Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni  Home/Search
Context Related
Links: DBLP | dis.uniroma1.it/pub/d...wae00dsp.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 Problem Downloading? From: dis.uniroma1.it/pub/demetres/p... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present the first experimental study of the fully dynamic single-source shortest paths problem in digraphs with arbitrary (negative and non-negative) arc weights. We implemented and tested several variants of the theoretically fastest fully dynamic algorithms proposed in the literature, plus a new algorithm devised to be as simple as possible while matching the best worst-case bounds for the problem. According to experiments performed on randomly generated test sets, all the ... (Update)
Cited by: More
A dynamic algorithm for topologically sorting - Directed Acyclic Graphs (Correct)
Speeding Up Dynamic Shortest Path Algorithms - Buriol, Resende, Thorup (Correct)
Online Algorithms for Topological Order and Strongly Connected.. - Pearce (2003) (Correct)
Similar documents (at the sentence level):
17.2%: Fully Dynamic Algorithms for Path Problems on Directed Graphs - Demetrescu (Correct)
Active bibliography (related documents): More All
0.7: An Experimental Study of Dynamic Algorithms for.. - Frigioni, Miller.. (2000) (Correct)
0.4: Experimental Analysis of Dynamic Algorithms for.. - Frigioni.. (1997) (Correct)
0.3: Experimental Analysis of Dynamic All Pairs Shortest.. - Demetrescu.. (2003) (Correct)
Similar documents based on text: More All
0.4: A Fully Dynamic Algorithm for Distributed Shortest Paths - Cicerone, Di Stefano.. (Correct)
0.4: Fully Dynamic Output Bounded Single Source.. - Frigioni.. (Correct)
0.3: Semi-dynamic Algorithms for Maintaining.. - Frigioni.. (Correct)
Related documents from co-citation: More All
4: Fully dynamic transitive closure: Breaking through the O - Demetrescu, Italiano - 2000
4: Introduction to algorithms (context) - Cormen, Leiserson et al. - 1991
3: Lower And Upper Bounds For Incremental Algorithms - Berman - 1992
BibTeX entry: (Update)
C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proc. 4th Workshop on Algorithm Engineering. Lecture Notes in Computer Science, to appear, 2000. http://citeseer.ist.psu.edu/demetrescu00maintaining.html More
@article{ demetrescu01maintaining,
author = "Camil Demetrescu and Daniele Frigioni and Alberto Marchetti-Spaccamela and Umberto Nanni",
title = "Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study",
journal = "Lecture Notes in Computer Science",
volume = "1982",
pages = "218--??",
year = "2001",
url = "citeseer.ist.psu.edu/demetrescu00maintaining.html" }
Citations (may not include all citations):151 Algorithms and Applications (context) - Ahuja, Magnanti et al. - 1993
97 Shortest paths algorithms: Theory and experimental evaluatio.. - Cherkassky, Goldberg et al. - 1996 DBLP
72 a platform for combinatorial and geometric computing (context) - Mehlhorn, Naher - 1995
68 Theoretical improvements in algorithmic efficiency for netwo.. (context) - Edmonds, Karp - 1972 ACM DBLP
33 Bounded incremental computation (context) - Ramalingam - 1996 ACM
26 the computational complexity of dynamic graph problems - Ramalingam, Reps - 1996
24 Negative-cycle detection algorithms - Cherkassky, Goldberg - 1996
17 Fully dynamic algorithms for maintaining shortest paths tree.. (context) - Frigioni, Marchetti-Spaccamela et al. - 2000 ACM DBLP
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 ACM
9 Experimental Analysis of Dynamic Algorithms for the Single S.. - Frigioni, Ioffreda et al. - 1998
9 Semi-dynamic shortest paths and breadth-first search on digr.. - Franciosa, Frigioni et al. - 1997
8 Selecting problems for algorithm evaluation (context) - Goldberg - 1999 ACM DBLP
7 A heuristic improvement of the Bellman-Ford algorithm - Goldberg, Radzik - 1993
5 An experimental study of dynamic algorithms for directed gra.. (context) - Frigioni, Miller et al. - 1998 ACM DBLP
5 Fully dynamic shortest paths and negative cycles detection o.. - Frigioni, Marchetti-Spaccamela et al. - 1998 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dis.uniroma1.it/pub/demetres/papers/): More
Removing Cycles for Minimizing Crossings - Demetrescu, Finocchi (2001) (Correct)
Visualization in Algorithm Engineering: Tools and.. - Demetrescu, Finocchi.. (Correct)
Break the "Right" Cycles and Get the "Best" Drawing - Demetrescu, Finocchi (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