On the Minimal Total Path Length of a Spanning Tree

Simple item page
dc.contributor.authorKang, Andy N. C.en
dc.contributor.authorAult, David A.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:49Zen
dc.date.available2013-06-19T14:36:49Zen
dc.date.issued1974en
dc.description.abstractThe 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.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000785/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000785/01/CS74032-R.pdfen
dc.identifier.trnumberCS74032-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20275en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleOn the Minimal Total Path Length of a Spanning Treeen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS74032-R.pdf
Size:
800.68 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports