Accession Number:

ADA070099

Title:

Diameters of Random Graphs.

Descriptive Note:

Technical rept.,

Corporate Author:

WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS

Personal Author(s):

Report Date:

1979-03-01

Pagination or Media Count:

42.0

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.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE