An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph

Alain Bretto (1) , Hocine Cherifi (2) , Stéphane Ubéda (3)

1 UJM - Université Jean Monnet - Saint-Étienne
2 Le2i - Laboratoire Electronique, Informatique et Image [UMR6306]
3 CITI - CITI Centre of Innovation in Telecommunications and Integration of services

In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to recognize if a linear hypergraph has the Helly property.

Domaines: Traitement des images [eess.IV]; Calcul parallèle, distribué et partagé [cs.DC]; Réseaux et télécommunications [cs.NI]

Alain Bretto, Hocine Cherifi, Stéphane Ubéda. An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph. Electronic Notes in Theoretical Computer Science, 2001, 46, pp.177-187. ⟨10.1016/S1571-0661(04)80985-X⟩. ⟨hal-01359224⟩