Marshals, monotone marshals, and hypertree-width
From MaRDI portal
Publication:3159383
DOI10.1002/jgt.20025zbMath1089.68074OpenAlexW4255714760MaRDI QIDQ3159383
Publication date: 16 February 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20025
Hypergraphs (05C65) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10)
Related Items (11)
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems ⋮ Tree projections and structural decomposition methods: minimality and game-theoretic characterization ⋮ An annotated bibliography on guaranteed graph searching ⋮ A unified theory of structural tractability for constraint satisfaction problems ⋮ Hypertree width and related hypergraph invariants ⋮ CSP duality and trees of bounded pathwidth ⋮ Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems ⋮ Tangle and ultrafilter: game theoretical interpretation ⋮ Tree-Width for First Order Formulae ⋮ Tree Projections: Game Characterization and Computational Aspects ⋮ Uniform Constraint Satisfaction Problems and Database Theory
Cites Work
This page was built for publication: Marshals, monotone marshals, and hypertree-width
