A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph

Networks

Volumn 27, Issue 3, 1996, Pages 215-217

  Mirchandani, Prakash ^a  

^a UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039270442     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199605)27:3<215::AID-NET6>3.0.CO;2-L     Document Type: Article

References (5)

1. K. S. Booth and G. S. Leuker, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13 (1976) 335-379.
2. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
3. P. Mirchandani, R. Kohli, and A. Tamir, Capacitated location problems on a straight line. Working Paper (1994). Trans. Sci., to appear.
4. R. Ravi, M. V. Marathe, and C. Pandu Rangan, An optimal algorithm to solve the all-pair shortest path problem on interval graphs. Networks 22 (1992) 21-35.
5. F. S. Roberts, Graph Theory and its Applications to Problems of Society. SIAM Press, Philadelphia (1978).