Tree Projections: Hypergraph Games and Minimality

DOI10.1007/978-3-540-70575-8_60MaRDI QIDQ3521962zbMATH OpenOpenAlexFDO

Authors Gianluigi Greco, Francesco Scarcello

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_60

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43)

Recommendations

• Tree projections and structural decomposition methods: minimality and game-theoretic characterization
• Tree projections: Game characterization and computational aspects
• Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
• Tree-Related Widths of Graphs and Hypergraphs
• Hypertree width and related hypergraph invariants

Cited in

(8)

• A direct independence proof of Buchholz's Hydra Game on finite labeled trees
• Hypertree-depth and minors in hypergraphs
• Thick Subtrees, Games and Experiments
• Hyperconsistency width for constraint satisfaction: Algorithms and complexity results
• Tree projections: Game characterization and computational aspects
• scientific article; zbMATH DE number 3902439 (Why is no real title available?)
• Tree projections and structural decomposition methods: minimality and game-theoretic characterization
• scientific article; zbMATH DE number 7614167 (Why is no real title available?)

This page was built for publication: Tree Projections: Hypergraph Games and Minimality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521962)