Sparse random graphs methods, structure, and heuristics
This dissertation is an algorithmic study of sparse random graphs which are parametrized by the distribution of vertex degrees. Our contributions include: a formula for the diameter of various sparse random graphs, including the Erdös-Rényi random graphs G[subscript n,m] and G[subscript n,p] and cer...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2152/3576 |