An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph

DOI10.1016/S1571-0661(04)80985-XzbMath1260.05157OpenAlexW2092341401MaRDI QIDQ4917098

Stéphane Ubéda, Hocine Cherifi, Alain Bretto

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80985-x

Mathematics Subject Classification ID

Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Complexity aspects of generalized Helly hypergraphs ⋮ On efficiently solvable cases of quantum \(k\)-SAT

Cites Work

• Finding and counting given length cycles
• On the Helly property working as a compactness criterion on graphs
• Neighborhood perfect graphs
• The Helly property
• Helly property in finite set systems
• Domination in quadrangle-free Helly graphs
• A polynomial algorithm for the strong Helly property
• Hypergraph imaging: An overview
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item