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 metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00424863
Contributor : Alexis Darrasse <>
Submitted on : Monday, October 19, 2009 - 9:28:20 AM
Last modification on : Thursday, March 21, 2019 - 2:31:55 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

204

Files downloads

354