C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proc. Workshop on Algorithm Engineering, pages 218--229. LNCS, 2000. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
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)
A Dynamic Algorithm for Topologically Sorting Directed Acyclic .. - Pearce, Kelly (2004) (3 citations) (Correct)
A Note on Models, Algorithms, and Data Structures for.. - Ferreira, Viennot (2002) (Correct)
Experimental Analysis of Dynamic All Pairs Shortest.. - Demetrescu.. (2003) (1 citation) Self-citation (Demetrescu) (Correct)
An Experimental Study of Dynamic Algorithms for.. - Frigioni, Miller.. (2000) (2 citations) Self-citation (Frigioni Nanni) (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