DOAJ Open Access 2007

Properties of Random Graphs via Boltzmann Samplers

Konstantinos Panagiotou Andreas Weißl

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (2)

Konstantinos Panagiotou

Andreas Weißl

Format Sitasi

APA MLA BibTeX

Panagiotou, K., Weißl, A. (2007). Properties of Random Graphs via Boltzmann Samplers. https://doi.org/10.46298/dmtcs.3552

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3552

Informasi Jurnal

Tahun Terbit: 2007
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3552
Akses: Open Access ✓