Pages that link to "Item:Q3057608"
From MaRDI portal
The following pages link to Complexity Results for the Spanning Tree Congestion Problem (Q3057608):
Displaying 7 items.
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- On the extremal structure of an OSPF related cone (Q934186) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Spanners of bounded degree graphs (Q1944059) (← 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 (Q6670816) (← links)
