Constructive Linear Time Algorithms for Branchwidth

We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width.

• Type: Conference
• Year: 1997
• Where: ICALP
• Authors: Hans L. Bodlaender, Dimitrios M. Thilikos
• Keywords: Branch Decomposition, ICALP 1997, Linear Time Algorithm, Programming Languages