Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
暂无分享,去创建一个
Daniele Frigioni | Camil Demetrescu | Alberto Marchetti-Spaccamela | Umberto Nanni | C. Demetrescu | U. Nanni | A. Marchetti-Spaccamela | D. Frigioni
[1] Andrew V. Goldberg,et al. Negative-Cycle Detection Algorithms , 1996, ESA.
[2] A. Goldberg,et al. A heuristic improvement of the Bellman-Ford algorithm , 1993 .
[3] G. Ramalingam. Bounded Incremental Computation , 1996, Lecture Notes in Computer Science.
[4] Daniele Frigioni,et al. Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights , 1998, ESA.
[5] Thomas W. Reps,et al. On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..
[6] Giuseppe Cattaneo,et al. An empirical study of dynamic graph algorithms , 1996, SODA '96.
[7] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.
[8] Daniele Frigioni,et al. Experimental analysis of dynamic algorithms for the single source shortest paths problem , 1998, JEAL.
[9] Andrew V. Goldberg,et al. Selecting Problems for Algorithm Evaluation , 1999, WAE.
[10] Giuseppe Cattaneo,et al. Experimental analysis of dynamic minimum spanning tree algorithms , 1997, SODA '97.
[11] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[12] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 2001, Combinatorial Optimization.
[13] Daniele Frigioni,et al. An Experimental Study of Dynamic Algorithms for Directed Graphs , 1998, ESA.
[14] William L. Ditto,et al. Principles and applications of chaotic systems , 1995, CACM.
[15] Daniele Frigioni,et al. Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.
[16] Andrew V. Goldberg,et al. Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.
[17] Daniele Frigioni,et al. Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs , 1997, STACS.