Document Open Access Logo

Practical Algorithms for Linear Boolean-width

Authors Chiel B. ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender

Thumbnail PDF


  • Filesize: 0.59 MB
  • 12 pages

Document Identifiers

Author Details

Chiel B. ten Brinke
Frank J. P. van Houten
Hans L. Bodlaender

Cite AsGet BibTex

Chiel B. ten Brinke, Frank J. P. van Houten, and Hans L. Bodlaender. Practical Algorithms for Linear Boolean-width. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 187-198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)


In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the generated decompositions. We also evaluated dynamic programming algorithms on linear boolean decompositions for several vertex subset problems. This evaluation shows that such algorithms are often much faster (up to several orders of magnitude) compared to theoretical worst case bounds.
  • graph decomposition
  • boolean-width
  • heuristics
  • exact algorithms
  • vertex subset problems


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail