Linear Algorithms for Finding the Jordan Center and Path Center of a Tree

S. Mitchell Hedetniemi, E. J. Cockayne and S. T. Hedetniemi
Additional contact information
S. Mitchell Hedetniemi: University of Oregon, Eugene, Oregon
E. J. Cockayne: University of Victoria, Victoria, British Columbia
S. T. Hedetniemi: University of Oregon, Eugene, Oregon

Transportation Science, 1981, vol. 15, issue 2, 98-114

Abstract: This paper contains linear algorithms for finding the Jordan center, the weighted Jordan center and the path center of a tree. All of these algorithms take advantage of an efficient data structure for representing a tree called a canonical recursive representation. As a result, the first two algorithms are different from and faster than similar algorithms in the literature. This paper also defines a new parameter of a graph called the path center, and shows that the path center of a tree T consists of a unique subpath of T .

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.15.2.98 (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:15:y:1981:i:2:p:98-114

Access Statistics for this article

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