scientific article; zbMATH DE number 7053309
From MaRDI portal
zbMath1423.68593MaRDI QIDQ5743430
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095173
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Approximate tree decompositions of planar graphs in linear time, On orthogonally guarding orthogonal polygons with bounded treewidth, Unnamed Item, Capacitated domination: problem complexity and approximation algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rank-width and tree-width of \(H\)-minor-free graphs
- Graph minors. III. Planar tree-width
- Approximation algorithms for treewidth
- Graph minors. X: Obstructions to tree-decomposition
- A partial k-arboretum of graphs with bounded treewidth
- Call routing and the ratcatcher
- Graph minors. XIII: The disjoint paths problem
- Easy problems for tree-decomposable graphs
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
- Rank‐width is less than or equal to branch‐width
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
