Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs

Qian-Ping Gu, Gengchun Xu. Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. In Dieter Kratsch, Ioan Todinca, editors, Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers. Volume 8747 of Lecture Notes in Computer Science, pages 238-249, Springer, 2014. [doi]

Abstract

Abstract is missing.