On the Minimal Total Path Length of a Spanning Tree
(1974) On the Minimal Total Path Length of a Spanning Tree. Technical Report CS74032-R, Computer Science, Virginia Tech.
Full text available as: |
Abstract
The notions of a balance node and the total path length with respect to a node u of a spanning tree are defined. We show that the total path length of a spanning tree with respect to u is minimal if and only if u is a balance node. An algorithm is also given to locate a balance node. A proof of the correctness of the algorithm is given and the complexity of the algorithm is analyzed.
| Item Type: | Departmental Technical Report |
|---|---|
| Keywords: | spanning tree, total path length, balance node, proof of correctness and analysis of complexity of an algorithm |
| Subjects: | Computer Science > Historical Collection(Till Dec 2001) |
| ID Code: | 785 |
| Deposited By: | Administrator, Eprints |
| Deposited On: | 18 April 2006 |