Spanning tree congestion of the hypercube
From MaRDI portal
Publication:1045206
DOI10.1016/j.disc.2009.07.007zbMath1179.05032OpenAlexW2764962283MaRDI QIDQ1045206
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.07.007
hypercubeisoperimetric inequalityspanning tree congestionminimum congestion spanning treeedge-boundary
Related Items
A Survey on Spanning Tree Congestion ⋮ THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK ⋮ Optimality computation of the minimum stretch spanning tree problem ⋮ Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks ⋮ Regular connected bipancyclic spanning subgraphs of hypercubes ⋮ Parameterized complexity of the spanning tree congestion problem ⋮ Spanning tree congestion of \(k\)-outerplanar graphs ⋮ Complexity Results for the Spanning Tree Congestion Problem ⋮ Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Cites Work
- Unnamed Item
- On tree congestion of graphs
- On induced subgraphs of the cube
- A note on the edges of the n-cube
- Minimal congestion trees
- Minimum congestion spanning trees of grids and discrete toruses
- Assignment of Numbers to Vertices
- Maximally Connected Arrays on the n-Cube
- Optimal Assignments of Numbers to Vertices
