Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs

DOI10.1007/978-3-319-12340-0_20MaRDI QIDQ6827655zbMATH OpenFDO

Authors Qian-Ping Gu, Gengchun Xu

Publication date 9 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12340-0_20

zbMATH Keywords

approximation algorithmbranch-/tree-decompositionsgrid minorplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

This page was built for publication: Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827655)