Minimum congestion spanning trees in planar graphs
From MaRDI portal
Publication:966018
DOI10.1016/j.disc.2009.11.016zbMath1230.05112arXiv0909.3903MaRDI QIDQ966018
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.3903
Related Items
A Survey on Spanning Tree Congestion, Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition, Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem, Spanning tree congestion of \(k\)-outerplanar graphs, Parameterized complexity of the spanning tree congestion problem, The minimum stretch spanning tree problem for typical graphs, Optimality computation of the minimum stretch spanning tree problem, Complexity Results for the Spanning Tree Congestion Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On tree congestion of graphs
- On spanning tree congestion of graphs
- On spanning tree congestion
- Designing multi-commodity flow trees
- Minimal congestion trees
- The congestion of \(n\)-cube layout on a rectangular grid
- Sobolev spaces on graphs
- Minimum congestion spanning trees of grids and discrete toruses
- Spanning Trees and Optimization Problems