Practical Algorithms for Linear Boolean-width
Published in DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) • Jan 1, 2015
NobleIDNI6P42W07R34S96
Authors:,,
Chiel B. Ten Brinke
Frank J. P. van Houten
Hans L. Bodlaender
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 ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!