Diameters of Random Graphs.
WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS
Pagination or Media Count:
In addition to being of interest for its own sake, the study of random graphs provides the combinatorial foundation for investigations of the average-case behavior of various graph-theoretic algorithms. Diameters of graphs are especially relevant to algorithms based on breadth-first search. The present paper deals with the family G approximate n,E of all labeled graphs that have n nodes and E edges.
- Theoretical Mathematics