DISTANCES IN AN ARRAY: AN ALTERNATIVE DESCRIPTION FOR LARGE SCALE NETWORK TOPOLOGY.

Document Type

Conference Proceeding

Publication Date

1-1-1988

Description

In the complete graph on an (m, n) array, methods are given for finding how many links have a given length and for finding the average length of a link. A method is also given for finding the average length of a link in a graph where there is an upper bound on the length of a link.

Share

COinS