Tree-Related Widths of Graphs and Hypergraphs

DOI10.1137/050623395zbMath1162.05032OpenAlexW2091522522MaRDI QIDQ3614197

Isolde Adler

Publication date: 16 March 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2a713e876b547cf32e2a2471114e7f2e7f72f9ba

zbMATH Keywords

hypergraphsstrategytree-widthhypertree-widthinfinite hypergraphshypergraph sandwich problemrober and marshals game

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems ⋮ Hypertree-depth and minors in hypergraphs ⋮ Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems ⋮ Clique-width of point configurations ⋮ Tree-Width for First Order Formulae ⋮ Structural tractability of enumerating CSP solutions

This page was built for publication: Tree-Related Widths of Graphs and Hypergraphs