SAT-encodings for special treewidth and pathwidth
From MaRDI portal
Publication:1680270
DOI10.1007/978-3-319-66263-3_27zbMath1496.68266OpenAlexW2745231626MaRDI QIDQ1680270
Sebastian Ordyniak, Stefan Szeider, Neha Lodha
Publication date: 15 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-66263-3_27
Graph theory (including graph drawing) in computer science (68R10) Computational aspects of satisfiability (68R07)
Related Items (5)
Computing optimal hypertree decompositions with SAT ⋮ Unnamed Item ⋮ Parameterized algorithms for book embedding problems ⋮ Parameterized Algorithms for Book Embedding Problems ⋮ Unnamed Item
This page was built for publication: SAT-encodings for special treewidth and pathwidth
