The connectivity-profile of random increasing k-trees

DOI10.1137/1.9781611973006.13zbMath1430.68187arXiv0910.3639OpenAlexW1553543480MaRDI QIDQ5194684

Alexis Darrasse, Olivier Bodini, Michèle Soria, Hsien-Kuei Hwang

Publication date: 16 September 2019

Published in: 2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.3639

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Shape Measures of Random Increasing k-trees ⋮ Some Properties of Random Apollonian Networks

This page was built for publication: The connectivity-profile of random increasing k-trees