Maximin Center of Pendant Vertices in a Tree Network

I. Douglas Moon
Additional contact information
I. Douglas Moon: Rutgers University, Newark, New Jersey

Transportation Science, 1989, vol. 23, issue 3, 213-216

Abstract: The problem is to find a point in a tree whose distance to the closest pendant vertex is maximum. This paper presents a polynomial-time algorithm which reduces the given tree successively until such a point is found.

Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.3.213 (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:23:y:1989:i:3:p:213-216

Access Statistics for this article

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