Back to Search
Start Over
Linear Algorithms for Finding the Jordan Center and Path Center of a Tree.
- Source :
-
Transportation Science . May81, Vol. 15 Issue 2, p98. 17p. - Publication Year :
- 1981
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00411655
- Volume :
- 15
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Transportation Science
- Publication Type :
- Academic Journal
- Accession number :
- 4450041
- Full Text :
- https://doi.org/10.1287/trsc.15.2.98