eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2015-11-19
187
198
10.4230/LIPIcs.IPEC.2015.187
article
Practical Algorithms for Linear Boolean-width
ten Brinke, Chiel B.
van Houten, Frank J. P.
Bodlaender, Hans L.
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.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol043-ipec2015/LIPIcs.IPEC.2015.187/LIPIcs.IPEC.2015.187.pdf
graph decomposition
boolean-width
heuristics
exact algorithms
vertex subset problems