Some Algorithms for Analyzing Trivalent Planted Trees.
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1973
- Accession Number
- AD0768370
Entities
People
- Charles Werner
- J. S. Smart
Organizations
- IBM Thomas J. Watson Research Center