Automata, Languages and Programming
From MaRDI portal
Publication:5466463
DOI10.1007/B99859zbMath1098.68009OpenAlexW2505584480MaRDI QIDQ5466463
No author found.
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15)
Related Items (5)
On bucket increasing trees, clustered increasing trees and increasing diamonds ⋮ Uniform preferential selection model for generating scale-free networks ⋮ A Geometric Preferential Attachment Model of Networks II ⋮ A combinatorial approach to the analysis of bucket recursive trees ⋮ Unnamed Item
This page was built for publication: Automata, Languages and Programming
