Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs

DOI10.1016/j.ipl.2012.05.005zbMath1248.05092OpenAlexW2012010258MaRDI QIDQ456059

David Duris

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.05.005

zbMATH Keywords

combinatorial problemsgraph algorithmshypergraph acyclicity

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

On optimization problems in acyclic hypergraphs ⋮ On the complexity of binary polynomial optimization over acyclic hypergraphs ⋮ A polyhedral study of lifted multicuts ⋮ A hybrid tractable class for non-binary CSPs ⋮ The Multilinear Polytope for Acyclic Hypergraphs ⋮ Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT

Cites Work

• Unnamed Item
• Unnamed Item
• Hypertree decompositions and tractable queries
• On the complexity of database queries
• Degrees of acyclicity for hypergraphs and relational database schemes
• On Acyclic Conjunctive Queries and Constant Delay Enumeration

This page was built for publication: Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs