Computing Optimal Hypertree Decompositions

DOI10.1137/1.9781611976007.1OpenAlexW2995165452MaRDI QIDQ5147487FDOQ5147487

Authors André Schidler, Stefan Szeider

Publication date 27 January 2021

Published in 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611976007.1

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(13)

• Computing optimal hypertree decompositions with SAT
• Finding good tree decompositions by local search
• Tree-Related Widths of Graphs and Hypergraphs
• Fast and parallel decomposition of constraint satisfaction problems
• Weighted hypertree decompositions and optimal query plans
• Incremental and Efficient Computation of Families of Component Trees
• HyperBench. A benchmark and tool for hypergraphs and empirical findings
• Complexity Analysis of Generalized and Fractional Hypertree Decompositions
• Optimal tree decompositions revisited: a simpler linear-time FPT algorithm
• Finding the hardest formulas for resolution
• scientific article; zbMATH DE number 6862107 (Why is no real title available?)
• Tree decomposition and discrete optimization problems: a survey
• An Iterative Heuristic Algorithm for Tree Decomposition

This page was built for publication: Computing Optimal Hypertree Decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147487)