HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

The connectivity-profile of random increasing k-trees

Abstract : Random increasing k-trees represent an interesting, useful class of strongly dependent graphs for which analytic-combinatorial tools can be successfully applied. We study in this paper a notion called connectivity-profile and derive asymptotic estimates for it; some interesting consequences will also be given.
Document type :
Conference papers
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00424863
Contributor : Alexis Darrasse Connect in order to contact the contributor
Submitted on : Monday, October 19, 2009 - 9:28:20 AM
Last modification on : Friday, January 8, 2021 - 5:32:06 PM
Long-term archiving on: : Wednesday, June 16, 2010 - 12:52:27 AM

Files

increasing_ktrees.pdf
Files produced by the author(s)

Identifiers

Citation

Alexis Darrasse, Hsien-Kuei Hwang, Olivier Bodini, Michèle Soria. The connectivity-profile of random increasing k-trees. Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Jan 2010, Austin, United States. pp.99-106, ⟨10.1137/1.9781611973006.13⟩. ⟨hal-00424863⟩

Share

Metrics

Record views

99

Files downloads

185