Accession Number : AD0768370

Title :   Some Algorithms for Analyzing Trivalent Planted Trees.

Descriptive Note : Technical rept.,

Corporate Author : IBM THOMAS J WATSON RESEARCH CENTER YORKTOWN HEIGHTS N Y

Personal Author(s) : Smart,J. S. ; Werner,C.

Report Date : SEP 1973

Pagination or Media Count : 21

Abstract : Some algorithms for analyzing trivalent planted trees are presented. These algorithms are all based on a binary string representation of the network and include procedures for determining path lengths, diameters, and aggregate properties of subnetworks. A method is described for randomly generating a trivalent planted tree with a specified number of links in such a way that each topologically distinct network with that number of links has the same probability of occurring. (Author)

Descriptors :   (*GRAPHICS, THEOREMS), TOPOLOGY, NETWORKS, ALGORITHMS, RIVERS, MATHEMATICAL MODELS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE