Geodesic
Algorithms for searching paths in huge graphs
Fundamentalʹnaâ i prikladnaâ matematika, Tome 19 (2014) no. 1, pp. 165-172.

Voir la notice de l'article provenant de la source Math-Net.Ru

Various approaches for data storing and processing are investigated in this paper. A new algorithm for finding paths in a huge graph is introduced. 
@article{FPM_2014_19_1_a7,
     author = {I. V. Polyakov and A. A. Chepovskiy and A. M. Chepovskiy},
     title = {Algorithms for searching paths in huge graphs},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {165--172},
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a7/}
}
TY  - JOUR
AU  - I. V. Polyakov
AU  - A. A. Chepovskiy
AU  - A. M. Chepovskiy
TI  - Algorithms for searching paths in huge graphs
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 2014
SP  - 165
EP  - 172
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a7/
LA  - ru
ID  - FPM_2014_19_1_a7
ER  - 
%0 Journal Article
%A I. V. Polyakov
%A A. A. Chepovskiy
%A A. M. Chepovskiy
%T Algorithms for searching paths in huge graphs
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2014
%P 165-172
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a7/
%G ru
%F FPM_2014_19_1_a7
I. V. Polyakov; A. A. Chepovskiy; A. M. Chepovskiy. Algorithms for searching paths in huge graphs. Fundamentalʹnaâ i prikladnaâ matematika, Tome 19 (2014) no. 1, pp. 165-172. http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a7/

[1] Barnes E. R., “An algorithm for partitioning the nodes of a graph”, SIAM J. Algebraic Discrete Methods, 4:3 (1982), 541–550 | DOI | MR

[2] Dijkstra E. W., “A note on two problems in connexion with graphs”, Numer. Math., 1 (1959), 269–271 | DOI | MR | Zbl

[3] Fakcharoenphol J., Rao S., “Planar graphs, negative weight edges, shortest paths, and near linear time”, Proc. 42nd IEEE Symp. Foundations of Computer Science, 2001, 232–241 | MR

[4] Fredman M. L., Tarjan R. E., “Fibonacci heaps and their uses in improved network optimization algorithms”, J. ACM, 34:3 (1987), 596–615 | DOI | MR

[5] Goldberg A. V., Harrelson C., “Computing the shortest path: $A^\ast$-search meets graph theory”, Proc. Sixteenth Annual ACM, SIAM Symp. on Discrete Algorithms (January 23–25, 2005, Vancouver, BC), 156–165 | MR | Zbl

[6] Hilger M., Köhler E., Möhring R. H., Schilling H., “Fast point-to-point shortest path computations with arc-flags”, The Shortest Path Problem, Ninth DIMACS Implementation Challenge, DIMACS Book, 74, eds. C. Demetrescu, A. V. Goldberg, D. S. Johnson, Amer. Math. Soc., 2009, 41–72 | MR | Zbl

[7] Steinhaus H., “Sur la division des corps matériels en parties”, Bull. Acad. Polon. Sci. Cl. III, 4 (1956), 801–804 | MR