Computing Optimal Hypertree Decompositions
From MaRDI portal
Publication:5147487
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
Cited In (13)
- Tree decomposition and discrete optimization problems: a survey
- Title not available (Why is that?)
- Incremental and Efficient Computation of Families of Component Trees
- HyperBench
- Weighted hypertree decompositions and optimal query plans
- Finding good tree decompositions by local search
- Finding the Hardest Formulas for Resolution
- An Iterative Heuristic Algorithm for Tree Decomposition
- Complexity Analysis of Generalized and Fractional Hypertree Decompositions
- Computing optimal hypertree decompositions with SAT
- Optimal tree decompositions revisited: a simpler linear-time FPT algorithm
- Tree-Related Widths of Graphs and Hypergraphs
- Fast and parallel decomposition of constraint satisfaction problems
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)
