Local/Global Phenomena in Geometrically Generated Graphs
From MaRDI portal
Publication:3520030
DOI10.1007/978-3-540-78808-9_5zbMath1142.68317OpenAlexW2177554122MaRDI QIDQ3520030
Publication date: 19 August 2008
Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78808-9_5
Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Generalizations of Polya's urn problem
- The small-world phenomenon
- The Diameter of a Cycle Plus a Random Matching
- Random Geometric Graphs
- Continuum Percolation
- Algorithms and Models for the Web-Graph
- Modeling the Small-World Phenomenon with Local Network Flow
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Local/Global Phenomena in Geometrically Generated Graphs