A polynomial algorithm for the strong Helly property

DOI10.1016/S0020-0190(01)00186-7zbMath1024.68898OpenAlexW1992786398MaRDI QIDQ1847378

Janez Žerovnik, Alain Bretto, Stéphane Ubéda

Publication date: 24 June 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00186-7

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

The Helly property on subfamilies of limited size ⋮ Faster recognition of clique-Helly and hereditary clique-Helly graphs ⋮ On neighborhood-Helly graphs ⋮ On the generalized Helly property of hypergraphs, cliques, and bicliques ⋮ An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph ⋮ On the strong \(p\)-Helly property ⋮ Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique graphs and Helly graphs
• Dismantling absolute retracts of reflexive graphs
• Helly property in finite set systems
• Domination in quadrangle-free Helly graphs
• Dually Chordal Graphs