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
Summary Related Articles Check |
This paper is cited in the following contexts:
Experimental Analysis of Dynamic All Pairs Shortest.. - Demetrescu.. (2003) (1 citation) Self-citation (Demetrescu) (Correct)
No context found.
C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proceedings of the 4-st Workshop on Algorithm Engineering (WAE'00), Saarbrucken, Germany, September 5-8, 2000.
An Experimental Study of Dynamic Algorithms for.. - Frigioni, Miller.. (2000) (2 citations) Self-citation (Frigioni Nanni) (Correct)
.... [9, 23, 24, 25] However, despite the number of interesting theoretical results achieved, very little has been done so far with respect to implementations even for the most fundamental problems (the only implementation e ort known to us is concerned with the maintenance of shortest path trees [10, 17]) In this paper, we are making a step forward in bridging the gap between theoretical results for transitive closure and their implementation by studying the practical properties of several dynamic algorithms for this problem. The main goal of the paper is to investigate in practice the ....
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.
A dynamic algorithm for topologically sorting - Directed Acyclic Graphs (Correct)
No context found.
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.
Speeding Up Dynamic Shortest Path Algorithms - Buriol, Resende, Thorup (Correct)
No context found.
C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. Algorithm Engineering, pages 218--229, 2000.
Online Algorithms for Topological Order and Strongly Connected.. - Pearce (2003) (Correct)
No context found.
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.
A Dynamic Algorithm for Topologically Sorting Directed Acyclic .. - Pearce, Kelly (2004) (3 citations) (Correct)
No context found.
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.
A Note on Models, Algorithms, and Data Structures for.. - Ferreira, Viennot (2002) (Correct)
No context found.
C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proceedings of the 4th Workshop on Algorithm Engineering (WAE) 2000.
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