An efficient algorithm for Helly property recognition in a linear hypergraph
From MaRDI portal
Recommendations
- Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
- scientific article; zbMATH DE number 1409177
- On the strong \(p\)-Helly property
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
- On the generalized Helly property of hypergraphs, cliques, and bicliques
Cites work
- A polynomial algorithm for the strong Helly property
- Domination in quadrangle-free Helly graphs
- Finding and counting given length cycles
- Helly property in finite set systems
- Helly type theorem and graphs
- scientific article; zbMATH DE number 3902654 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3641484 (Why is no real title available?)
- scientific article; zbMATH DE number 490025 (Why is no real title available?)
- scientific article; zbMATH DE number 736306 (Why is no real title available?)
- scientific article; zbMATH DE number 1182897 (Why is no real title available?)
- Hypergraph imaging: An overview
- Neighborhood perfect graphs
- On the Helly property working as a compactness criterion on graphs
- The Helly property
Cited in
(4)
This page was built for publication: An efficient algorithm for Helly property recognition in a linear hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917098)