论文信息 - A simple linear-time algorithm for computing the center of an interval graph

A simple linear-time algorithm for computing the center of an interval graph

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.

Stephan Olariu | S. Olariu

[1] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[2] Arthur M. Farley,et al. Computation of the center and diameter of outerplanar graphs , 1980, Discret. Appl. Math..

[3] F. Roberts. Graph Theory and Its Applications to Problems of Society , 1987 .

[4] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[5] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[6] A. J. Goldman. Minimax Location of a Facility in a Network , 1972 .