Some characterizations of and -acyclicity of hypergraphs
From MaRDI portal
Publication:456059
Recommendations
- scientific article; zbMATH DE number 1135725
- On \(\gamma\)-hyperellipticity of graphs
- scientific article; zbMATH DE number 4081615
- On hypergraph acyclicity and graph chordality
- On acyclic and cyclic hypergraphs
- scientific article; zbMATH DE number 4029622
- Counting minimal transversals of -acyclic hypergraphs
- scientific article; zbMATH DE number 3937210
- A note on \(\gamma\)-graphs
Cites work
- scientific article; zbMATH DE number 3683635 (Why is no real title available?)
- scientific article; zbMATH DE number 1756016 (Why is no real title available?)
- Degrees of acyclicity for hypergraphs and relational database schemes
- Hypertree decompositions and tractable queries
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- On the complexity of database queries
Cited in
(9)- Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT
- A hybrid tractable class for non-binary CSPs
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
- Transit functions and pyramid-like binary clustering systems
- A polyhedral study of lifted multicuts
- The multilinear polytope for acyclic hypergraphs
- On optimization problems in acyclic hypergraphs
- On the cut-vertex and the interval transit functions of hypergraphs
This page was built for publication: Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456059)
