A polynomial algorithm for the strong Helly property

DOI10.1016/S0020-0190(01)00186-7MaRDI QIDQ1847378zbMATH OpenOpenAlexFDO

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

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)

Cites work

• Clique graphs and Helly graphs
• Dismantling absolute retracts of reflexive graphs
• Domination in quadrangle-free Helly graphs
• Dually Chordal Graphs
• 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 1409177 (Why is no real title available?)

Cited in

(7)

• Faster recognition of clique-Helly and hereditary clique-Helly graphs
• On the strong \(p\)-Helly property
• On the generalized Helly property of hypergraphs, cliques, and bicliques
• On neighborhood-Helly graphs
• An efficient algorithm for Helly property recognition in a linear hypergraph
• The Helly property on subfamilies of limited size
• Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs

This page was built for publication: A polynomial algorithm for the strong Helly property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847378)