LIPIcs.IPEC.2015.187.pdf
- Filesize: 0.59 MB
- 12 pages
Document
Practical Algorithms for Linear Boolean-width
Authors
- Publication date: 2015-11-19
- License:
Creative Commons Attribution 3.0 Unported license
-
Part of:
Volume:
10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Parameterized and Exact Computation (IPEC)
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)
https://doi.org/10.4230/LIPIcs.IPEC.2015.187
https://doi.org/10.4230/LIPIcs.IPEC.2015.187
Abstract
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.
Keywords
- graph decomposition
- boolean-width
- heuristics
- exact algorithms
- vertex subset problems
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads