Spanning tree congestion of k-outerplanar graphs

DOI10.1016/J.DISC.2011.03.002MaRDI QIDQ536232zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

\(k\)-outerplanar graphsspanning tree congestion

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Spanning tree congestion of planar graphs
• Complexity results for the spanning tree congestion problem
• On spanning tree congestion of graphs
• Parameterized complexity of the spanning tree congestion problem
• On spanning tree congestion

Cites work

• scientific article; zbMATH DE number 5990058 (Why is no real title available?)
• scientific article; zbMATH DE number 3547322 (Why is no real title available?)
• A partial k-arboretum of graphs with bounded treewidth
• A variation on the min cut linear arrangement problem
• Complexity results for the spanning tree congestion problem
• Minimal congestion trees
• Minimum congestion spanning trees in planar graphs
• Minimum congestion spanning trees of grids and discrete toruses
• On colorings of squares of outerplanar graphs
• On spanning tree congestion
• On spanning tree congestion of graphs
• On tree congestion of graphs
• Spanning tree congestion of rook's graphs
• Spanning tree congestion of the hypercube
• Tree Spanners
• Tree spanners in planar graphs

Cited in

(11)

• 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
• The spanning tree congestion problem on interval graphs

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)