Two relational structures are indistinguishable by k-RCR if and only if they receive identical homomorphism counts from every structure of generalised hypertreewidth ≤ k.
Hypertree decompositions and tractable queries
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
A framework integrating local direct reciprocity and global indirect reciprocity shows conditional cooperators resist invasion by unconditional strategies and that forgiving strategies best sustain cooperation.
Submodular width is approximated within 3/2 by a branchwidth parameter from edge separations and admissible submodular costs, and satisfies subw(H) = Omega(ghw(H) / log ghw(H)) under natural conditions.
citing papers explorer
-
Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width
Two relational structures are indistinguishable by k-RCR if and only if they receive identical homomorphism counts from every structure of generalised hypertreewidth ≤ k.
-
A model of local and global reciprocity
A framework integrating local direct reciprocity and global indirect reciprocity shows conditional cooperators resist invasion by unconditional strategies and that forgiving strategies best sustain cooperation.
-
Cuts and Gauges for Submodular Width
Submodular width is approximated within 3/2 by a branchwidth parameter from edge separations and admissible submodular costs, and satisfies subw(H) = Omega(ghw(H) / log ghw(H)) under natural conditions.
- Work-Efficient Query Evaluation in Constant Time with PRAMs