Constructive linear time algorithms for branchwidth

  • Hans L. Bodlaender
  • Dimitrios M. Thilikos
Session 15: Algorithms III

DOI: 10.1007/3-540-63165-8_217

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1256)
Cite this paper as:
Bodlaender H.L., Thilikos D.M. (1997) Constructive linear time algorithms for branchwidth. In: Degano P., Gorrieri R., Marchetti-Spaccamela A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg

Abstract

Let Gk be the class of graphs with branchwidth at most k. In this paper we prove that one can construct, for any k, a linear time algorithm that checks if a graph belongs to Gk and, if so, outputs a branch decomposition of minimum width. Moreover, we find the obstruction set for Gk and, for the same class, we give a safe and complete set of reduction rules. Our results lead to a practical linear time algorithm that checks if a graph has branchwidth ≤3 and, if so, outputs a branch decomposition of minimum width.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Hans L. Bodlaender
    • 1
  • Dimitrios M. Thilikos
    • 1
  1. 1.Department of Computer ScienceUtrecht UniversityTB UtrechtThe Netherlands

Personalised recommendations