Journal of Zhejiang University-SCIENCE A

, Volume 5, Issue 9, pp 1135–1143 | Cite as

Optimal parallel algorithm for shortest-paths problem on interval graphs

Applied Mathematics
  • 38 Downloads

Abstract

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 words

Parallel algorithms Shortest-paths problem Interval graphs 

Document code

CLC number

O29 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D., 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.MATHGoogle Scholar
  2. Atallah, M.J., Chen, D.Z., 1989. An optimal parallel algorithm for the minimum circle cover problem. Information Processing Letters, 32:159–165.MathSciNetCrossRefMATHGoogle Scholar
  3. Bertossi, A.A., 1988. Parallel circle cover algorithms. Information Processing Letters, 27:133–139.MathSciNetCrossRefMATHGoogle Scholar
  4. Booth, K.S., Luckher, G.S., 1976. Testing for the consecutive ones properly, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13:335–379.MathSciNetCrossRefMATHGoogle Scholar
  5. 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
  6. Gabow, H.N., Tarjan, R.E., 1985. A linear time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, 30:209–221.MathSciNetCrossRefMATHGoogle Scholar
  7. Golumbic, M.C., 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.MATHGoogle Scholar
  8. Gupta, U.I., Lee, D.T., Leung, J.Y.T., 1982. Efficient algorithms for interval graphs and circular-arc graphs. Networks, 12:459–467.MathSciNetCrossRefMATHGoogle Scholar
  9. 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
  10. Lee, C.C., Lee, D.T., 1984. On a circle cover minimization problem. Information Processing Letters 18:109–115.MathSciNetCrossRefMATHGoogle Scholar
  11. 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
  12. 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
  13. Mishra, P.K., 2004. An efficient parallel algorithm for shortest-paths in planar layered digraphs. Journal of Zhejiang University SCIENCE, 5(5):518–527.CrossRefMATHGoogle Scholar

Copyright information

© Zhejiang University Press 2004

Authors and Affiliations

  1. 1.Department of Applied MathematicsBirla Institute of TechnologyMesra-RanchiIndia

Personalised recommendations