Skip to main content
SpringerLink
Log in

A new upper bound on the complexity of the all pairs shortest path problem

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 570))

Included in the following conference series:

This work was partially supported by a research grant from Hitachi Engineering Co., Ltd.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Hopcroft, J.E. and Ullman, J.D., The design and analysis of computer algorithms, Addison-Wesley (1974).

    Google Scholar 

  2. Akl, S.G., The design and analysis of parallel algorithms, Prentice-Hall (1989).

    Google Scholar 

  3. Dekel, E., Nassimi, D. and Sahni, S., “Parallel matrix and graph algorithms,” SIAM Jour. on Computing, Vol. 10, No. 4, pp. 657–675 (1981).

    Google Scholar 

  4. Dekel, E. and Sahni, S., “Binary trees and parallel scheduling algorithms,” IEEE Trans. on Computers, Vol. C-32, No. 3, pp. 307–315 (1983)

    Google Scholar 

  5. Fredman, M.L., “New bounds on the complexity of the shortest path problem,” SIAM Jour. on Computing, Vol. 5, No. 1, pp. 83–85 (1976).

    Google Scholar 

  6. Moffat, A. and Takaoka, T., “An all pairs shortest path algorithm with expected running time O(n 2 log n),” SIAM Jour. on Computing, Vol. 16, No. 6, pp. 1023–1031 (1987).

    Google Scholar 

  7. Takaoka, T., “ An efficient parallel algorithm for the all pairs shortest path problem,” WG 88, Lecture Notes in Computer Science 344, Springer-Verlag, pp. 276–287 (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Ibaraki University, Hitachi, Ibaraki, Japan

    Tadao Takaoka

Authors
  1. Tadao Takaoka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gunther Schmidt Rudolf Berghammer

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takaoka, T. (1992). A new upper bound on the complexity of the all pairs shortest path problem. In: Schmidt, G., Berghammer, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 1991. Lecture Notes in Computer Science, vol 570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55121-2_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-55121-2_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55121-8

  • Online ISBN: 978-3-540-46735-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation