Optimal parallel algorithm for shortest-paths problem on interval graphs
- 38 Downloads
This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.
Key wordsParallel algorithms Shortest-paths problem Interval graphs
Unable to display preview. Download preview PDF.
- Chen, D.Z., Lee, D.T., 1994. Solving the All Pair Shortest-path Problem on Interval and Circular-arc Graphs. Proceedings of the 8th International Parallel Processing Symposium, Cancun, Mexico, p.224–228.Google Scholar
- Ibarra, O.H., Wang, H., Zheng, Q., 1992. Minimum Cover and Single Source Shortest-path Problems for Weighted Interval Graphs and Circular-ARc Graphs. Proceeding of the 30th Annual Allerton Conference on Communication, Control and Computing, University of Illinois, Urbana, p.575–584.Google Scholar
- Mishra, P.K., Sharma, C.K., 1997. A Computational Study of the Shortest-path Algorithms in C-Programming Language. Proc. Fifth International Conference on Applications of High Performance Computing in Engineering, Santiago de Compostela, Spain.Google Scholar
- Mishra, P.K., Sharma, C.K., 2002. An efficient implementation of scaling algorithms for the shortest-paths problem. News Bulletin of Calcutta Mathematical Society, 27:342–351.Google Scholar