The degree distribution of random \(k\)-trees
From MaRDI portal
Publication:1006039
DOI10.1016/j.tcs.2008.10.015zbMath1162.68024OpenAlexW2137465421MaRDI QIDQ1006039
Publication date: 17 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.015
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)
Related Items (8)
Modeling spatial networks by contact graphs of disk packings ⋮ Shape Measures of Random Increasing k-trees ⋮ Justifying the small-world phenomenon via random recursive trees ⋮ The degree profile in some classes of random graphs that generalize recursive trees ⋮ Randomized rumor spreading in poorly connected small-world networks ⋮ Some Properties of Random Apollonian Networks ⋮ Ancestors and descendants in evolving k‐tree models ⋮ The height of random k‐trees and related branching processes
Cites Work
- Unnamed Item
- The degree distribution of the generalized duplication model
- Treewidth. Computations and approximations
- The degree sequence of a scale-free random graph process
- Statistical mechanics of complex networks
- The degree sequences and spectra of scale-free random graphs
- A general model of web graphs
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- Editorial: The Future of Power Law Research
- On the bias of traceroute sampling
This page was built for publication: The degree distribution of random \(k\)-trees