SAT-based local improvement for finding tree decompositions of small width
From MaRDI portal
Publication:1680268
DOI10.1007/978-3-319-66263-3_25zbMath1496.68154OpenAlexW2744965439MaRDI QIDQ1680268
Neha Lodha, Johannes K. Fichte, Stefan Szeider
Publication date: 15 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-66263-3_25
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Unnamed Item ⋮ Practical Access to Dynamic Programming on Tree Decompositions ⋮ Practical access to dynamic programming on tree decompositions ⋮ An Experimental Study of the Treewidth of Real-World Graph Data
This page was built for publication: SAT-based local improvement for finding tree decompositions of small width
