Minimum congestion spanning trees of grids and discrete toruses

DOI10.7151/dmgt.1461zbMath1193.05058OpenAlexW2148141257MaRDI QIDQ3560779

Mikhail I. Ostrovskii, Alberto Castejón

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

discrete torusgrid graphminimum congestion spanning tree

Mathematics Subject Classification ID

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

Related Items (9)

A Survey on Spanning Tree Congestion ⋮ Optimality computation of the minimum stretch spanning tree problem ⋮ Parameterized complexity of the spanning tree congestion problem ⋮ Spanning tree congestion of \(k\)-outerplanar graphs ⋮ Minimum congestion spanning trees in planar 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 ⋮ Spanning tree congestion of the hypercube

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