Email RIS file
Bookmark
Report an Issue

Maximum-Path Leaves Relative to Vertices and the Vertex One Center of a Spanning Tree [electronic resource] : An Enumeration and Analysis of Configurations

Published
Washington, D.C. : United States. Dept. of Defense, 1998.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
Physical Description
19 pages : digital, PDF file
Additional Creators
Los Alamos National Laboratory, United States. Department of Defense, and United States. Department of Energy. Office of Scientific and Technical Information
Access Online

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Free-to-read Unrestricted online access
Summary
This paper enumerates the configurations of a pair of vertices (one of which is a leaf) relative to the unique vertex one center and the leaf of greatest path length from this center in a spanning tree of a graph. From this enumeration, it demonstrates that the vertex one center is between the vertex and the leaf of greatest path length from the vertex for every such pair of vertices. Using this result this paper develops an algorithm for the optimal reconfiguration of a tree infrastructure required to recover from the failure of a network element.
Report Numbers
E 1.99:la-13521-ms
la-13521-ms
Subject(s)
Other Subject(s)
Note
Published through SciTech Connect.
10/01/1998.
"la-13521-ms"
Dowell, L.J.
Type of Report and Period Covered Note
Topical;
Funding Information
W-7405-ENG-36
View MARC record | catkey: 14348472