Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
Summary: Introduce a Robber-and-Marshals game: hypergraph H has hypertree-width ≤ k iff k marshals can trap the robber, extending the cops-and-robbers/treewidth characterization to hypergraphs. Characterize HW[k]=GF_k(L) (k‑guarded fragment of existential-conjunctive FO) and show GF_k(FO) equals nonrecursive stratified datalog of hypertreewidth ≤ k. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Georg Gottlob (Vienna University of Technology)
- 2. Nicola Leone (University of Calabria)
- 3. Francesco Scarcello (University of Calabria)
BibTeX Citation
@inproceedings{gottlob_pods01,
address = {New York, NY, USA},
series = {{PODS} '01},
title = {{Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width}},
url = {https://dl.acm.org/doi/10.1145/375551.375579},
doi = {10.1145/375551.375579},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
year = {2001}
}
Incoming Citations (Sorted by Pagerank)
Showing 17 of 17 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,338 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB |
| 2 | 8,675 | Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth | 2022 | PODS |
| 3 | 7,759 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS |
| 4 | 10,155 | FPT Parameterisations of Fractional and Generalised Hypertree Width | 2026 | PODS |
| 5 | 673 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS |
| 6 | 2,678 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 7 | 814 | Hypertree Decompositions: Questions and Answers | 2016 | PODS |
| 8 | 6,159 | General and Fractional Hypertree Decompositions: Hard and Easy Cases | 2018 | PODS |
| 9 | 2,330 | Hypertree Decompositions and Tractable Queries | 1999 | PODS |
| 10 | 11,523 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS |