Minimum congestion spanning trees of grids and discrete toruses

DOI10.7151/DMGT.1461zbMATH Open1193.05058OpenAlexW2148141257MaRDI QIDQ3560779FDOQ3560779

Authors: Alberto Castejón, Mikhail Ostrovskii 

Publication date: 14 May 2010

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2c26c83642aa3591f63ad3220039508c8d46e271

zbMATH Keywords

grid graphdiscrete torusminimum congestion spanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cited In (9)

• Parameterized complexity of the spanning tree congestion problem
• Spanning tree congestion of \(k\)-outerplanar graphs
• Hardness results and an exact exponential algorithm for the spanning tree congestion problem
• Minimum congestion spanning trees in planar graphs
• Spanning tree congestion of the hypercube
• The minimum stretch spanning tree problem for typical graphs
• Complexity results for the spanning tree congestion problem
• Optimality computation of the minimum stretch spanning tree problem
• A Survey on Spanning Tree Congestion

This page was built for publication: Minimum congestion spanning trees of grids and discrete toruses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560779)