Abstract
The paper is addressed to the problem of locating the absolute and vertex centers (minimax criterion) of an undirected tree graph. Based upon a convexity property of the criterion function a very simple and efficient algorithm is offered that locates the minimax point by locating first a maximax point. The minimax is at the mid-point of the maximum path from the maximax point. The vertex center is located simultaneously.
Original language | English |
---|---|
Pages (from-to) | 287-293 |
Number of pages | 7 |
Journal | Transportation Science |
Volume | 7 |
Issue number | 3 |
DOIs | |
State | Published - 1973 |