On spanning tree congestion of graphs
From MaRDI portal
Publication:1043936
DOI10.1016/j.disc.2008.12.021zbMath1232.05116OpenAlexW2056879109MaRDI QIDQ1043936
Yota Otachi, Koichi Yamazaki, Kyohei Kozawa
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.021
Related Items (11)
A Survey on Spanning Tree Congestion ⋮ Optimality computation of the minimum stretch spanning tree problem ⋮ Better hardness results for the minimum spanning tree congestion problem ⋮ Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition ⋮ Parameterized complexity of the spanning tree congestion problem ⋮ Spanning tree congestion of \(k\)-outerplanar graphs ⋮ Minimum congestion spanning trees in planar graphs ⋮ Security number of grid-like graphs ⋮ Complexity Results for the Spanning Tree Congestion Problem ⋮ Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem ⋮ The minimum stretch spanning tree problem for typical graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The treewidth and pathwidth of hypercubes
- On the minimum average distance spanning tree of the hypercube
- On tree congestion of graphs
- On embedding graphs in trees
- On induced subgraphs of the cube
- Edge-isoperimetric inequalities in the grid
- Designing multi-commodity flow trees
- Call routing and the ratcatcher
- Minimal congestion trees
- Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
- The congestion of \(n\)-cube layout on a rectangular grid
- The carvingwidth of hypercubes
- Very Simple Methods for All Pairs Network Flow Analysis
- A variation on the min cut linear arrangement problem
- Multi-Terminal Network Flows
- Cutwidth I: A linear time fixed parameter algorithm
- Wiener index of trees: Theory and applications
This page was built for publication: On spanning tree congestion of graphs
