Planar Branch Decompositions II: The Cycle Method
From MaRDI portal
Publication:2892258
DOI10.1287/ijoc.1040.0074zbMath1239.05177OpenAlexW2157362754MaRDI QIDQ2892258
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1040.0074
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
On the minimum corridor connection problem and other generalized geometric problems ⋮ New analysis and computational study for the planar connected dominating set problem ⋮ Practical algorithms for branch-decompositions of planar graphs ⋮ A combinatorial optimization algorithm for solving the branchwidth problem ⋮ Treewidth lower bounds with brambles ⋮ Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs ⋮ Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms ⋮ A Local Search Algorithm for Branchwidth
Uses Software
This page was built for publication: Planar Branch Decompositions II: The Cycle Method
