A simple linear-time algorithm for computing the center of an interval graph
Stephan Olariu · International Journal of Computer Mathematics · 1990
The computational problem of finding the center of a graph is motivated by a number of facility-location problems. We exploit a new characterization of interval graphs for the purpose of obtaining a linear-time algorithm for computing both the center and the diameter of an interval graph.