Parameterized spanning tree congestion
From MaRDI portal
No records found.
Cites work
- A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
- A faster algorithm for vertex cover parameterized by solution size
- A new dynamic programming approach for spanning trees with chain constraints and beyond
- A partial k-arboretum of graphs with bounded treewidth
- A single-exponential time 2-approximation algorithm for treewidth
- A Survey on Spanning Tree Congestion
- A variation on the min cut linear arrangement problem
- Algorithmic meta-theorems for restrictions of treewidth
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
- An FPT algorithm for spanning trees with few branch vertices parameterized by modular-width
- Approximating minimum bounded degree spanning trees to within one of optimal
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
- Approximating spanning tree congestion on graphs with polylog degree
- Better hardness results for the minimum spanning tree congestion problem
- Bin packing with fixed number of bins revisited
- Clique-width is NP-complete
- Cluster vertex deletion: a parameterization between vertex cover and clique-width
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
- Finding spanning trees with perfect matchings
- FPT approximation using treewidth: capacitated vertex cover, target set selection and vector dominating set
- Graph theory
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- scientific article; zbMATH DE number 2086635 (Why is no real title available?)
- scientific article; zbMATH DE number 7759283 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Improved upper bounds for vertex cover
- Lower-Stretch Spanning Trees
- Minimal congestion trees
- Minimum congestion spanning trees in planar graphs
- Minimum congestion spanning trees of grids and discrete toruses
- Minimum stable cut and treewidth
- Network design under general wireless interference
- On simplified NP-complete variants of \textsc{Monotone 3-Sat}
- On spanning tree congestion
- On spanning tree congestion of graphs
- On tree congestion of graphs
- Parameterized (approximate) defective coloring
- Parameterized algorithms
- Parameterized Algorithms for Modular-Width
- Parameterized Algorithms for Parity Games
- Parameterized Approximation Schemes Using Graph Widths
- Parameterized complexity of the spanning tree congestion problem
- Parameterized power vertex cover
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
- Spanners in sparse graphs
- Spanners of bounded degree graphs
- Spanning tree congestion and computation of generalized Győri-Lovász partition
- Spanning tree congestion of k-outerplanar graphs
- Spanning tree congestion of rook's graphs
- Spanning tree congestion of the hypercube
- Spanning Trees with Few Branch Vertices
- Spanning Trees with Many Leaves
- The complexity ecology of parameters: An illustration using bounded max leaf number
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Tree Spanners
- Tree spanners in planar graphs
- Using petal-decompositions to build a low stretch spanning tree
- When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\)
This page was built for publication: Parameterized spanning tree congestion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310240)
