Spanning tree congestion of k-outerplanar graphs
From MaRDI portal
Publication:536232
DOI10.1016/J.DISC.2011.03.002zbMATH Open1223.05017OpenAlexW2046337003WikidataQ59567625 ScholiaQ59567625MaRDI QIDQ536232FDOQ536232
Authors: Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi 
Publication date: 16 May 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.002
Recommendations
Cites Work
- A partial k-arboretum of graphs with bounded treewidth
- Tree Spanners
- Tree spanners in planar graphs
- On spanning tree congestion of graphs
- On spanning tree congestion
- Spanning tree congestion of the hypercube
- Spanning tree congestion of rook's graphs
- Title not available (Why is that?)
- On tree congestion of graphs
- Minimum congestion spanning trees in planar graphs
- Title not available (Why is that?)
- On colorings of squares of outerplanar graphs
- Minimal congestion trees
- Complexity results for the spanning tree congestion problem
- Minimum congestion spanning trees of grids and discrete toruses
- A variation on the min cut linear arrangement problem
Cited In (10)
- Spanning tree congestion of planar graphs
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- The minimum stretch spanning tree problem for typical graphs
- Optimality computation of the minimum stretch spanning tree problem
- Better hardness results for the minimum spanning tree congestion problem
- Spanning tree congestion of rook's graphs
- Spanning tree congestion and computation of generalized Győri-Lovász partition
- A Survey on Spanning Tree Congestion
- Better hardness results for the minimum spanning tree congestion problem
- On the extremal structure of an OSPF related cone
This page was built for publication: Spanning tree congestion of \(k\)-outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536232)
