A Survey on Spanning Tree Congestion
From MaRDI portal
Publication:5042456
DOI10.1007/978-3-030-42071-0_12OpenAlexW3020636320MaRDI QIDQ5042456
Publication date: 19 October 2022
Published in: Treewidth, Kernels, and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-42071-0_12
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning tree congestion of planar graphs
- Spanning tree congestion of \(k\)-outerplanar graphs
- Exact exponential algorithms.
- Minimum congestion spanning trees in bipartite and random graphs
- On tree congestion of graphs
- Minimum congestion spanning trees in planar graphs
- On spanning tree congestion of graphs
- On spanning tree congestion
- Spanning tree congestion of the hypercube
- A partial k-arboretum of graphs with bounded treewidth
- Parameterized complexity of the spanning tree congestion problem
- Minimal congestion trees
- Algorithmic graph theory and perfect graphs
- Spanning tree congestion of rook's graphs
- Complexity Results for the Spanning Tree Congestion Problem
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows
- Fourier meets M\"{o}bius: fast subset convolution
- Minimum congestion spanning trees of grids and discrete toruses
- A variation on the min cut linear arrangement problem
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- A homology theory for spanning tress of a graph
- Graph Classes: A Survey
- Tree Spanners
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
This page was built for publication: A Survey on Spanning Tree Congestion
