Pages that link to "Item:Q3785979"
From MaRDI portal
The following pages link to A variation on the min cut linear arrangement problem (Q3785979):
Displaying 11 items.
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- Routing with critical paths (Q910228) (← links)
- Communication tree problems (Q995575) (← links)
- On spanning tree congestion of graphs (Q1043936) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- On the complexity of tree embedding problems (Q1209372) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← 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)
