The following pages link to Minimal congestion trees (Q1877665):
Displaying 22 items.
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- Minimum congestion spanning trees in bipartite and random graphs (Q655852) (← links)
- On tree congestion of graphs (Q952638) (← links)
- Minimum congestion spanning trees in planar graphs (Q966018) (← links)
- On spanning tree congestion of graphs (Q1043936) (← 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)
- Spanners of bounded degree graphs (Q1944059) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
- Designing low-congestion networks with structural graph theory (Q2908593) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- Minimal Locked Trees (Q3183441) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- A Survey on Spanning Tree Congestion (Q5042456) (← links)
- (Q5089157) (← links)
- (Q5115814) (← links)
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem (Q5892589) (← links)
- The minimum centroid branch spanning tree problem (Q6566796) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6670816) (← links)
