An average study of hypergraphs and their minimal transversals

Julien David 1, 2 Loïck Lhote 3 Arnaud Mary 4, 5 François Rioult 6
2 EXMO - Computer mediated exchange of structured knowledge
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
6 Equipe CODAG - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : 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.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2015, 596, pp.124-141. 〈10.1016/j.tcs.2015.06.052〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01086638
Contributeur : Loïck Lhote <>
Soumis le : lundi 12 juin 2017 - 22:19:21
Dernière modification le : dimanche 17 février 2019 - 01:20:40

Lien texte intégral

Identifiants

Citation

Julien David, Loïck Lhote, Arnaud Mary, François Rioult. An average study of hypergraphs and their minimal transversals. Theoretical Computer Science, Elsevier, 2015, 596, pp.124-141. 〈10.1016/j.tcs.2015.06.052〉. 〈hal-01086638v2〉

Partager

Métriques

Consultations de la notice

507