Solving the all-pair shortest path query problem on interval and circular-arc graphs

Networks

Volumn 31, Issue 4, 1998, Pages 249-258

  Chen, Danny Z ^a   Lee, D T ^b   Sridhar, R ^c   Sekharan, Chandra N ^d  

^a University of Notre Dame   (United States)

^b Northwestern University   (United States)

^c University of Oklahoma   (United States)

^d LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040579524     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1097-0037(199807)31:4<249::aid-net5>3.0.co;2-d     Document Type: Article

References (21)

1. R. J. Anderson and G. L. Miller, Deterministic parallel list ranking. Algorithmica 6 (1991) 859-868.
2. M. J. Atallah and D. Z. Chen, An optimal parallel algorithm for the minimum circle-cover problem. Inf. Process. Lett. 32 (1989) 159-165.
3. M. J. Atallah, D. Z. Chen, and D. T. Lee, An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Algorithmica 14 (1995) 429-441.
4. O. Berkman and U. Vishkin, Finding level-ancestors in trees. J. Comput. Syst. Sci. 48 (1994) 214-230.
5. O. Berkman and U. Vishkin, Personal communication.
6. K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13 (1976) 335-379.
7. R. Cole, Parallel merge sort. SIAM J. Comput. 17 (1988) 770-785.
8. R. Cole and U. Vishkin, Approximate parallel scheduling, part I: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM J. Comput. 17 (1988) 128-142.
9. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progression. Proceedings of the 19th ACM Symposium on Theory of Computing (1987) 1-6.
10. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
11. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
12. U. I. Gupta, D. T. Lee, and J. Y.-T. Leung, Efficient algorithms for interval graphs and circular-arc graphs. Networks 12 (1982) 459-467.
13. O. H. Ibarra, H. Wang, and Q. Zheng, Minimum cover and single source shortest path problems for weighted interval graphs and circular-arc graphs. Proceedings of the Thirtieth Annual Allerton Conference on Communication,Control, and Computing, University of Illinois, Urbana (1992) 575-584.
14. N. Korte and R. H. Möhring, A simple linear-time algorithm to recognize interval graphs. Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science, Germany (G. Tinhofer and G. Schmidt). (1986) 1-16.
15. C. P. Kruskal, L. Rudolph, and M. Snir, The power of parallel prefix. IEEE Trans. Comput. C-34 (1985) 965-968.
16. R. E. Ladner and M. J. Fischer, Parallel prefix computation. J. ACM 27 (1980) 831-838.
17. C. C. Lee and D. T. Lee, On a circle-cover minimization problem. Info. Process. Lett. 18 (1984) 109-115.
18. S. Olariu, J. L. Schwing, and J. Zhang, Optimal parallel algorithms for problems modeled by a family of intervals. IEEE Trans. Parallel Distrib. Syst. 3 (1992) 364-374.
19. R. Ravi, M. V. Marathe, and C. P. Rangan, An optimal algorithm to solve the all-pair shortest path problem on interval graphs. Networks 22 (1992) 21-35.
20. R. Seidel, On the all-pair-shortest-path problem. Proceedings of the 24th ACM Symposium on Theory of Computing (1992) 745-749.
21. R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14 (1985) 862-874.