Skip to main content
SpringerLink
Log in

An efficient parallel algorithm for shortest paths in planar layered digraphs

  • Applied & Financial Mathematics
  • Published:
Journal of Zhejiang University-SCIENCE A Aims and scope Submit manuscript

Abstract

This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs inO(log3 n) time withn processors. The algorithms uses a divide and conquer approach and is based on the novel idea of a one-way separator, which has the property that any directed path can be crossed only once.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aggarwal, A., Park, J., 1988. Notes on Searching Dimensional Monotone Arrays. Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, p. 496–512.

  • Alon, N., Galil, Z., 1991. On the Exponent of the All Pairs Shortest Path Problem. Proc. 32th Annual IEEE Symposium on Foundations of Computer Sciences,32: 569–575.

    MathSciNet  Google Scholar 

  • Apostolico, A., Atallah, M.J., Larmore, L., Mc Faddin, H.S., 1990. Efficient parallel algorithms for editing and related problems.SIAM Journal on Computing,19: 968–988.

    Article  MathSciNet  MATH  Google Scholar 

  • Atallah, M.J., 1990. A Faster Parallel Algorithm for A Matrix Searching Problem. Proc. 2th Scandinaviam Workshop on Algorithm Theory, p. 193–200.

  • Bellman, R., 1958. On a routing problem.Quarterly Journal of Applied Mathematics,16: 87–90.

    Article  MathSciNet  MATH  Google Scholar 

  • Cohen, E., 1993. Efficient Parallel Shortest Paths in Digraphs with A Separator Decomposition. Proc. 5th Annual Symposium on Parallel Algorithms and Architectures, p. 57–67.

  • Coremen, T.H., 1990. Introduction to Algorithms. MIT Press, Cambridge, MA.

    Google Scholar 

  • Delche, A.L., Kosarju, S.R., 1992. An N.C. Algorithm for Evaluating Monotone Planar Circuits.

  • Di Battisa, G., Nardelli, E., 1987. An Algorithm for Testing Planarity of Hierarchical Graphs. Proc. Workshop WG 86, Bernierd, p. 277–289.

  • Dijkastra, E.W., 1995. A note on two problems in connection with graphs.Numer. Math.,1: 269–271.

    Article  Google Scholar 

  • Fredericckson, G., 1987. Fast algorithms for shortest paths in planar graphs with Applications.SIAM J. Comput.,16: 1004–1022.

    Article  MathSciNet  Google Scholar 

  • Fredman, M.L., Tarjan, R.E., 1987. Fibonacci heaps and their uses in improved network optimization algorithms.Journal of the ACM,34(3): 596–615.

    Article  MathSciNet  Google Scholar 

  • Garit, H., Miller, G.L., 1987. A Parallel Algorithm for finding Separator in Planar Graphs. Proc. 28th Annual IEEE Symposium on Foundation of Computer Science, p. 238–248.

  • Generich, H.J., Lautenbach, K., 1973. Synchronisations graphics.Acta Inform,2: 513–520.

    Google Scholar 

  • Gondram, M., Minoux, M., 1984. In Graphs and Algorithms. Willey Interscience, New York, p. 143–161.

    Google Scholar 

  • Jàjà, J., 2001. Introduction to Parallel Algorithms. Addision-wesley, Reading MA.

    MATH  Google Scholar 

  • Klein, P.N., Subramanian, S., 1993. A Linear Processor Polylog-time Algorithm for Shortest Path in Planar Graphs. Proc. IEEE Symposium on Foundation of Computer Science, p. 259–270.

  • Levcopoulos, C., Lingas, A., 1992. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees.Algorithmica,8(3): 251–256.

    Article  MathSciNet  MATH  Google Scholar 

  • Lempel, A., Even, Cederbaum, S., 1986. An Algorithm for Planitry Testing of Graphs. Proc. Internet. Symposium, p. 215–232.

  • Lipton, R.J., Tarjan, R.E., 1979. A separator theorem for planar graphs.SIAM J. Appl. Math.,36: 177–189.

    Article  MathSciNet  MATH  Google Scholar 

  • Lipton, R.J., Tarjan, R.E., 1980. Application of a planar separator theorem.SIAM J. Appl. Math.,9: 615–627.

    MathSciNet  MATH  Google Scholar 

  • Miller, G.L., Thurston, W., 1986. Separator in Two and Three Dimensions. Proc. 22nd Annual ACM Symposium on Theory of Computing, p. 300–309.

  • Mishra, P.K., Sharma, C.K., 1997. A Computational Study of An Efficient Shortest Path Algorithms in C-programming Language. Proc. of 5th International Conference on Application of HPC in Engineering, Santiago de Compstela, Spain.

  • Mishra, P.K., Sharma, C.K., 1999. An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs. Proc. of 65th Annual Conference of Indian Mathematical society, India,2: 635–654.

    Google Scholar 

  • Preparta, P.P., Shamons, M.I., 1985. Computational Geometry. Sringer Verlag, New-York.

    Book  Google Scholar 

  • Tamassia, R., Preparta, P.P., 1990. Dynamic maintenance of planar digraphs with applications.Algorithmica,5: 509–527.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Mathematics, Birla Institute of Technology, Mesra, 835215, Ranchi, India

    Mishra P. K.

Authors
  1. Mishra P. K.
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mishra P. K..

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mishra, P.K. An efficient parallel algorithm for shortest paths in planar layered digraphs. J. Zheijang Univ.-Sci. 5, 518–527 (2004). https://doi.org/10.1631/jzus.2004.0518

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.2004.0518

Key words

Document code

CLC number

Search

Navigation