Pages that link to "Item:Q1759686"
From MaRDI portal
The following pages link to Parameterized complexity of the spanning tree congestion problem (Q1759686):
Displaying 14 items.
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- On the parameterized complexity of spanning trees with small vertex covers (Q779245) (← links)
- On the extremal structure of an OSPF related cone (Q934186) (← links)
- A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (Q1731506) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Completely independent spanning trees in (partial) \(k\)-trees (Q2516669) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- Fixed-Parameter Tractability for Non-Crossing Spanning Trees (Q3603545) (← 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)
- The minimum centroid branch spanning tree problem (Q6566796) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6670816) (← links)