Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs

DOI10.1137/1.9781611972887.15zbMath1427.68230OpenAlexW1506969660MaRDI QIDQ5233518

Zhengbing Bian, Yumi Yoshitake, Marjan Marzban, Qian-Ping Gu, Hisao Tamaki

Publication date: 11 September 2019

Published in: 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d1eda0bd8f6e93a5badf92549ecdb88ba9af0df7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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)

Related Items (3)

New analysis and computational study for the planar connected dominating set problem ⋮ Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs ⋮ Computational study on planar dominating set problem

This page was built for publication: Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs