DBScholar

Back to papers

General and Fractional Hypertree Decompositions: Hard and Easy Cases

Summary: Settles the long-standing complexity question: testing fhw(H) ≤ 2 is NP-complete, and via the same construction establishes NP-completeness for ghw(H) ≤ 2. Also identifies structural restrictions yielding tractable bounded-width testing. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
1741
Venue
PODS
Year
2018
Pagerank
5.9542729e-05
Overall Rank
6,159 | 57.75%
DOI
10.1145/3196959.3196962

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fischl_pods18,
        address = {New York, NY, USA},
        series = {{PODS} '18},
        title = {{General and Fractional Hypertree Decompositions: Hard and Easy Cases}},
        url = {https://dl.acm.org/doi/10.1145/3196959.3196962},
        doi = {10.1145/3196959.3196962},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fischl, Wolfgang and Gottlob, Georg and Pichler, Reinhard},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers