On tree congestion of graphs
From MaRDI portal
Publication:952638
DOI10.1016/j.disc.2007.04.030zbMath1151.05014OpenAlexW2111400740MaRDI QIDQ952638
Publication date: 12 November 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.030
Related Items
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 ⋮ 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 ⋮ On spanning tree congestion of graphs ⋮ On spanning tree congestion ⋮ Spanning tree congestion of the hypercube
Cites Work