Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano  Home/Search
Context Related
| brics.dk/%7Ealcomf...OMFTTR039.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dis.uniroma1.it/~d...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present the results of an extensive computational study on dynamic algorithms for all pairs shortest path problems. We describe our implementations of the recent dynamic algorithms of King [18] and of Demetrescu and Italiano [7], and compare them to the dynamic algorithm of Ramalingam and Reps [25] and to static algorithms on random, real-world and hard instances. Our experimental data suggest that some of the dynamic algorithms and their algorithmic techniques can be really of... (Update)
Cited by: More
Dynamic Approximate All-Pairs Shortest Paths In Undirected Graphs - Roditty, Zwick (Correct)
Engineering Shortest Path Algorithms - Demetrescu, Italiano (Correct)
A New Approach to - Dynamic All Pairs (Correct)
Active bibliography (related documents): More All
0.7: A New Approach to Dynamic All Pairs Shortest Paths - Demetrescu, Italiano (2002) (Correct)
0.7: Fully Dynamic All Pairs Shortest Paths with Real Edge Weights - Demetrescu, Italiano (2001) (Correct)
0.6: Dynamic Capacitated Minimum Spanning Trees - Jothi, Raghavachari (2004) (Correct)
Similar documents based on text: More All
0.4: mproved Bounds and New Trade-Offs for Dynamic All Pairs.. - Demetrescu (Correct)
0.4: Fully Dynamic Transitive Closure: Breaking Through the.. - Demetrescu, Italiano (2000) (Correct)
0.3: What Do We Learn from Experimental Algorithmics? - Demetrescu, Italiano (2000) (Correct)
Related documents from co-citation: More All
3: A new approach to dynamic all pairs shortest paths - Demetrescu, Italiano - 2003
2: Tighter fully-dynamic all pairs shortest paths (context) - Thorup - 2003
2: Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive.. - King - 1999
BibTeX entry: (Update)
C. Demetrescu, S. Emiliozzi, and G.F. Italiano. Experimental analysis of dynamic all pairs shortest path algorithms. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04) (to appear), 2004. http://citeseer.ist.psu.edu/demetrescu03experimental.html More
@misc{ demetrescu04experimental,
author = "C. Demetrescu and S. Emiliozzi and G. Italiano",
title = "Experimental analysis of dynamic all pairs shortest path algorithms",
text = "C. Demetrescu, S. Emiliozzi, and G.F. Italiano. Experimental analysis of
dynamic all pairs shortest path algorithms. In Proceedings of the 15th Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA'04) (to appear), 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/demetrescu03experimental.html" }
Citations (may not include all citations):354 A note on two problems in connexion with graphs (context) - Dijkstra - 1959
353 Fibonacci heaps and their use in improved network optimizati.. (context) - Fredman, Tarjan - 1987
97 Shortest paths algorithms: Theory and experimental evaluatio.. - Cherkassky, Goldberg et al. - 1996
85 Mathematics for the analysis of algorithms (context) - Greene, Knuth - 1982
50 line edge-deletion problem (context) - Even, Shiloach - 1981
49 An incremental algorithm for a generalization of the shortes.. - Ramalingam, Reps - 1996
33 Finding the hidden path: Time bounds for all-pairs shortest .. - Karger, Koller et al. - 1993
33 Bounded incremental computation (context) - Ramalingam - 1996
21 Fully dynamic algorithms for maintaining all-pairs shortest .. - King - 1999
15 An empirical study of dynamic graph algorithms - Alberts, Cattaneo et al. - 1997
13 Experimental analysis of dynamic minimum spanning tree algor.. - Amato, Cattaneo et al. - 1997
13 Shortest path algorithms: An evaluation using real road netw.. (context) - Zhan, Noon - 1998
10 The parametric problem of shortest distances (context) - Rodionov - 1968
10 A network evaluation procedure (context) - Loubal - 1967
9 Fully dynamic all pairs shortest paths with real edge weight.. - Demetrescu, Italiano - 2001
9 A new approach to dynamic all pairs shortest paths - Demetrescu, Italiano - 2003
7 A space saving trick for directed dynamic transitive closure.. (context) - King, Thorup - 2001
7 Maintaining shortest paths in digraphs with arbitrary arc we.. - Demetrescu, Frigioni et al. - 2000
7 engineering by optimizing OSPF weights (context) - Fortz, Thorup - 2000
6 Shortest path algorithms: Engineering aspects - Goldberg - 2001
5 New dynamic SPT algorithm based on a ball-and-string model - Narvaez, Siu et al. - 2001
5 An experimental study of dynamic algorithms for directed gra.. (context) - Frigioni, Miller et al. - 1998
5 ect of increasing or decreasing the length of a single arc o.. (context) - Murchland - 1967
2 Maintaining dynamic minimum spanning trees: An experimental .. (context) - Cattaneo, Faruolo et al. - 2002
2 An experimental study of poly-logarithmic fully-dynamic conn.. - Iyer, Karger et al. - 2000
1 Analysis of dynamic algorithms for the single source shortes.. (context) - Frigioni, Io et al. - 1998
1 New dynamic algorithms for shortest path tree computation - Narvaez, Siu et al. - 2000
http://developer.kde.org/~sewardj/
Documents on the same site (http://www.dis.uniroma1.it/~demetres/publications.html): More
Oracles for Distances Avoiding a Link-failure - Demetrescu, Thorup (2002) (Correct)
Programmazione in ambiente UNIX - Dispensa Didattica Consigliata (Correct)
A New Approach to Dynamic All Pairs Shortest Paths - Demetrescu, Italiano (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC