Diameters of Random Graphs.
Abstract
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1979
- Accession Number
- ADA070099
Entities
People
- David Larman
- Victor Klee
Organizations
- University of Washington