Skip to main content

Algorithms for Searching Paths in Huge Graphs

Abstract

Various approaches for data storing and processing are investigated in this paper. A new algorithm for finding paths in a huge graph is introduced.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    E. R. Barnes, “An algorithm for partitioning the nodes of a graph,” SIAM J. Algebraic Discrete Methods, 4, No. 3, 541–550 (1982).

    Article  Google Scholar 

  2. 2.

    E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numer. Math., 1, 269–271 (1959).

    MathSciNet  Article  MATH  Google Scholar 

  3. 3.

    J. Fakcharoenphol and S. Rao, “Planar graphs, negative weight edges, shortest paths, and near linear time,” in: Proc. 42nd IEEE Symp. Foundations of Computer Science (2001), pp. 232–241.

  4. 4.

    M. L. Fredman and R. E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,” J. ACM, 34, No. 3, 596–615 (1987).

    MathSciNet  Article  Google Scholar 

  5. 5.

    A. V. Goldberg and C. Harrelson, “Computing the shortest path: A *-search meets graph theory,” in: Proc. Sixteenth Annual ACM–SIAM Symp. on Discrete Algorithms, January 23–25, Vancouver, BC (2005 ), pp. 156–165.

  6. 6.

    M. Hilger, E. Köhler, R. H. Möhring, and H. Schilling, “Fast point-to-point shortest path computations with arc-flags,” in: C. Demetrescu, A. V. Goldberg, and D. S. Johnson, eds., The Shortest Path Problem: Ninth DIMACS Implementation Challenge, DIMACS Book, Vol. 74, Amer. Math. Soc. (2009), pp. 41–72.

  7. 7.

    H. Steinhaus, “Sur la division des corps matériels en parties,” Bull. Acad. Pol. Sci., Cl. III, No. 4, 801–804 (1956).

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to I. V. Polyakov.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 19, No. 1, pp. 165–172, 2014.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Polyakov, I.V., Chepovskiy, A.A. & Chepovskiy, A.M. Algorithms for Searching Paths in Huge Graphs. J Math Sci 211, 413–417 (2015). https://doi.org/10.1007/s10958-015-2612-1

Download citation

Keywords

  • Short Path
  • Short Path Problem
  • Adjacency List
  • Dijkstra Algorithm
  • Graph Link