Locating Central Paths in a Graph

Peter J. Slater
Additional contact information
Peter J. Slater: Sandia National Laboratories, Albuquerque, New Mexico

Transportation Science, 1982, vol. 16, issue 1, 1-18

Abstract: Concepts which measure the centrality of a vertex in a graph (eccentricity, distance and branch weight) are extended to paths in a graph. Locating paths with minimum eccentricity and distance, respectively, may be viewed as multicenter and multimedian problems, respectively, where the facilities are located on vertices that must constitute a path. The third problem is to find a path P in a graph for which the number of vertices in the largest component of G - P is minimized. The relationships among these concepts are studied. Most of the results presented are for trees, and, in particular, linear algorithms for finding paths in trees of minimum eccentricity and of minimum branch weight are presented. These problems arise in determining a “most accessible” linear route in a network according to several plausible criteria.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.16.1.1 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:16:y:1982:i:1:p:1-18

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().