Pages that link to "Item:Q1043936"
From MaRDI portal
The following pages link to On spanning tree congestion of graphs (Q1043936):
Displayed 11 items.
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- Minimum congestion spanning trees in planar graphs (Q966018) (← links)
- Security number of grid-like graphs (Q967295) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← 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 (Q5892589) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6091160) (← links)