Pages that link to "Item:Q1043936"
From MaRDI portal
The following pages link to On spanning tree congestion of graphs (Q1043936):
Displaying 22 items.
- Spanning tree congestion of planar graphs (Q394137) (← links)
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- Minimum congestion spanning trees in bipartite and random graphs (Q655852) (← links)
- On the extremal structure of an OSPF related cone (Q934186) (← links)
- On tree congestion of graphs (Q952638) (← links)
- Minimum congestion spanning trees in planar graphs (Q966018) (← links)
- Security number of grid-like graphs (Q967295) (← links)
- On spanning tree congestion (Q1044004) (← links)
- Spanning tree congestion of the hypercube (Q1045206) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Minimal congestion trees (Q1877665) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
- Spanning tree congestion of rook's graphs (Q2906358) (← links)
- Critical spanning tree and linear arrangement of torus (Q2918823) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- On the Red/Blue Spanning Tree Problem (Q3630196) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- A Survey on Spanning Tree Congestion (Q5042456) (← links)
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem (Q5891346) (← links)
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem (Q5892589) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6670816) (← links)
