Parameterized complexity of the spanning tree congestion problem
From MaRDI portal
(Redirected from Publication:1759686)
Recommendations
- Complexity results for the spanning tree congestion problem
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- On spanning tree congestion of graphs
- Spanning tree congestion of planar graphs
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 1929927 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3024665 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A simpler proof of the excluded minor theorem for higher surfaces
- A special planar satisfiability problem and a consequence of its NP- completeness
- A variation on the min cut linear arrangement problem
- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
- Approximation of minimum weight spanners for sparse graphs
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Bidimensional Parameters and Local Treewidth
- Combinatorial Local Planarity and the Width of Graph Embeddings
- Complexity results for the spanning tree congestion problem
- Diameter and treewidth in minor-closed graph families
- Efficient Planarity Testing
- Embedding grids in surfaces
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XVI: Excluding a non-planar graph
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
- Graphs on surfaces
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- Introduction to algorithms.
- Linearity of grid minors in treewidth with applications through bidimensionality
- Local tree-width, excluded minors, and approximation algorithms
- Minimal congestion trees
- Minimum congestion spanning trees in planar graphs
- Minimum congestion spanning trees of grids and discrete toruses
- On spanning tree congestion
- On spanning tree congestion of graphs
- On tree congestion of graphs
- On tree width, bramble size, and expansion
- Planar Formulae and Their Uses
- Quickly excluding a planar graph
- Spanners in Sparse Graphs
- Spanners of bounded degree graphs
- Spanning tree congestion of the hypercube
- The Complexity of Multiterminal Cuts
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Tree Spanners
- Tree spanners for bipartite graphs and probe interval graphs
- Tree spanners in planar graphs
- Tree spanners on chordal graphs: complexity and algorithms
Cited in
(16)- Spanning tree congestion of k-outerplanar graphs
- A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs
- The minimum centroid branch spanning tree problem
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- The minimum stretch spanning tree problem for typical graphs
- Fixed-Parameter Tractability for Non-Crossing Spanning Trees
- Complexity results for the spanning tree congestion problem
- Optimality computation of the minimum stretch spanning tree problem
- Better hardness results for the minimum spanning tree congestion problem
- Completely independent spanning trees in (partial) \(k\)-trees
- Spanning tree congestion and computation of generalized Győri-Lovász partition
- A Survey on Spanning Tree Congestion
- On the parameterized complexity of spanning trees with small vertex covers
- Better hardness results for the minimum spanning tree congestion problem
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- On the extremal structure of an OSPF related cone
This page was built for publication: Parameterized complexity of the spanning tree congestion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759686)
