|
|
|
|
Литература
|
|
| |
| 1. |
Barnes E. R., “An algorithm for partitioning the nodes of a graph”, SIAM J. Algebraic Discrete Methods, 4:3 (1982), 541–550    |
| 2. |
Dijkstra E. W., “A note on two problems in connexion with graphs”, Numer. Math., 1 (1959), 269–271  |
| 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 |
| 4. |
Fredman M. L., Tarjan R. E., “Fibonacci heaps and their uses in improved network optimization algorithms”, J. ACM, 34:3 (1987), 596–615 |
| 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 |
| 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 |
| 7. |
Steinhaus H., “Sur la division des corps matériels en parties”, Bull. Acad. Polon. Sci. Cl. III, 4 (1956), 801–804 |
