An average study of hypergraphs and their minimal transversals - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2015

An average study of hypergraphs and their minimal transversals


In this paper, we study some average properties of hypergraphs and the average com-plexity of algorithms applied to hypergraphs under different probabilistic models. Our approach is both theoretical and experimental since our goal is to obtain a random model that is able to capture the real-data complexity. Starting from a model that generalizes the Erdös-Renyi model [9, 10], we obtain asymptotic estimations on the average number of transversals, minimals and minimal transversals in a random hy-pergraph. We use those results to obtain an upper bound on the average complexity of algorithms to generate the minimal transversals of an hypergraph. Then we make our random model more complex in order bring it closer to real-data and identify cases where the average number of minimal tranversals is at most polynomial, quasi-polynomial or exponential.
Fichier principal
Vignette du fichier
AP-DAVID-2012-1.pdf (443.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01086638 , version 1 (24-11-2014)



Julien David, Loïck Lhote, Arnaud Mary, François Rioult. An average study of hypergraphs and their minimal transversals. Theoretical Computer Science, 2015, 596, pp.124-141. ⟨10.1016/j.tcs.2015.06.052⟩. ⟨hal-01086638⟩
785 View
364 Download



Gmail Facebook X LinkedIn More