Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

A bidirectional shortest-path algorithm with good average-case behavior (preliminary version)

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1985)

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

Included in the following conference series:

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.A., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

    Google Scholar 

  2. Balas, E., Toth, P., “Branch and Bound Methods for the Traveling Salesman Problem”, MSRR 488, Carnegie-Mellon University, March 1983

    Google Scholar 

  3. Dijkstra, E.W. “A Note on Two Problems in Connection With Graphs”, Numerische Mathematik, 1 (1959), pp. 260–271.

    Article  Google Scholar 

  4. Edmonds, J., Karp, R.M. “Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems”, Journal of the ACM, Vol. 19, No. 2, April 1972, pp. 248–264

    Article  Google Scholar 

  5. Lawler, E.L. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.

    Google Scholar 

  6. Ma, Y. “A Shortest Path Algorithm with Expected Running Time O(√V logV)”, Master's Project Report, UC Berkeley.

    Google Scholar 

  7. Mitrinovic, D.S. Analytic Inequalities. Springer-Verlag, 1970.

    Google Scholar 

  8. Perl, Y. “Average Analysis of Simple Path Algorithms”, Tech. Report UIUCDCS-R-77-905, University of Illinois at Urbana-Champaign, 1977.

    Google Scholar 

  9. Pohl, I. “Bidirectional Search.” Machine Intelligence, 6(1971), pp. 127–140.

    Google Scholar 

  10. Renyi, A. Probability Theory. North-Holland, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Toronto, Canada

    Michael Luby

  2. University of California at Berkeley, USA

    Prabhakar Ragde

Authors
  1. Michael Luby
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prabhakar Ragde
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luby, M., Ragde, P. (1985). A bidirectional shortest-path algorithm with good average-case behavior (preliminary version). In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015765

Download citation

  • DOI: https://doi.org/10.1007/BFb0015765

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15650-5

  • Online ISBN: 978-3-540-39557-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation