Properties of Random Graphs via Boltzmann Samplers

Abstract : This work is devoted to the understanding of properties of random graphs from graph classes with structural constraints. We propose a method that is based on the analysis of the behaviour of Boltzmann sampler algorithms, and may be used to obtain precise estimates for the maximum degree and maximum size of a biconnected block of a "typical'' member of the class in question. We illustrate how our method works on several graph classes, namely dissections and triangulations of convex polygons, embedded trees, and block and cactus graphs.
Type de document :
Communication dans un congrès
Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.171-182, 2007, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184800
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 17:00:26
Dernière modification le : jeudi 11 mai 2017 - 01:02:52
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 12:18:45

Fichier

dmAH0112.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184800, version 1

Collections

Citation

Konstantinos Panagiotou, Andreas Weißl. Properties of Random Graphs via Boltzmann Samplers. Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.171-182, 2007, DMTCS Proceedings. 〈hal-01184800〉

Partager

Métriques

Consultations de la notice

55

Téléchargements de fichiers

45