Upper Bounds on Boolean-Width with Applications to Exact Algorithms
From MaRDI portal
Publication:2867092
DOI10.1007/978-3-319-03898-8_26zbMath1407.68370OpenAlexW404522508MaRDI QIDQ2867092
Yuri Rabinovich, Martin Vatshelle, Jan Arne Telle
Publication date: 10 December 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_26
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
The graph formulation of the union-closed sets conjecture ⋮ Hardness of computing width parameters based on branch decompositions over the vertex set ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Stability for maximal independent sets
This page was built for publication: Upper Bounds on Boolean-Width with Applications to Exact Algorithms
