Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone  Home/Search
Context Related
| dsi.unive.it/~wae97/procee...pap6.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: dsi.unive.it/~wae97/pr...contents (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we perform experiments on the fully dynamic single source shortest path problem on directed graphs with positive real edge weights. We propose an experimental analysis of three different algorithms: Dijkstra's algorithm, and two output bounded algorithms by Ramalingam and Reps [15] and by Frigioni, Marchetti and Nanni [12]. The main goal of this paper is to provide a first experimental evidence for (a) the effectiveness of dynamic algorithms for shortest paths with respect to a... (Update)
Context of citations to this paper: More
.... 2 parameter to evaluate the practical efficiency of dynamic algorithms for the single source shortest path problem with positive weights [9]. If the digraph has a k bounded accounting function, then our algorithms require O(k log n) time per output update in the case of...
.... 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...
Cited by: More
Speeding Up Dynamic Shortest Path Algorithms - Buriol, Resende, Thorup (Correct)
A Memetic Algorithm for OSPF Routing - Buriol, Resende, Ribeiro, Mikkel (2002) (Correct)
Maintaining Shortest Paths in Digraphs with.. - Demetrescu.. (2000) (Correct)
Similar documents (at the sentence level):
41.9%: Experimental Analysis of Dynamic Algorithms for.. - Frigioni.. (1997) (Correct)
Active bibliography (related documents): More All
0.2: Fully Dynamic Shortest Paths and Negative Cycle.. - Frigioni.. (1998) (Correct)
0.2: A Software Library of Dynamic Graph Algorithms - Alberts, Cattaneo (1998) (Correct)
0.2: New Dynamic SPT Algorithm based on a Ball-and-String Model - Narváez, Siu, Tzeng (1999) (Correct)
Similar documents based on text: More All
0.5: Fully Dynamic Output Bounded Single Source.. - Frigioni.. (Correct)
0.5: An Experimental Study of Dynamic Algorithms for.. - Frigioni, Miller.. (2000) (Correct)
0.5: A Fully Dynamic Algorithm for Distributed Shortest Paths - Cicerone, Di Stefano.. (Correct)
Related documents from co-citation: More All
7: An incremental algorithm for a generalization of the shortest-path problem - Ramalingam, Reps - 1992
4: the Computational Complexity of Dynamic Graph Problems - Ramalingam, Reps - 1996
3: Maintenance of transitive closure and transitive reduction of graphs - Poutr'e, van Leeuwen - 1988
BibTeX entry: (Update)
D. Frigioni, M. Ioffreda, U. Nanni, and G. Pasqualone. Experimental analysis of dynamic algorithms for the single source shortest path problem. In Proc. 1st Workshop on Algorithm Engineering (WAE) , September 11-13, 1997, Venice, Italy, 1997. http://citeseer.ist.psu.edu/article/frigioni97experimental.html More
@article{ frigioni98experimental,
author = "Daniele Frigioni and Mario Ioffreda and Umberto Nanni and Giulio Pasquale",
title = "Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem",
journal = "ACM Journal of Experimental Algorithms",
volume = "3",
pages = "5",
year = "1998",
url = "citeseer.ist.psu.edu/article/frigioni97experimental.html" }
Citations (may not include all citations):353 Fibonacci Heaps and Their Use in Improved Network Optimizati.. (context) - Fredman, Tarjan - 1987
310 A Note on Two Problems in Connection with Graphs (context) - Dijkstra - 1959
151 Algorithms and Applications (context) - Ahuia, Magnanti et al. - 1993
101 Sparsification -- A Technique for Speeding up Dynamic Graph .. (context) - Eppstein, Galil et al. - 1992
97 Shortest Paths Algorithms: Theory and Experimental Evaluatio.. - Cherkassky, Goldberg et al. - 1994
72 a Platform for Combinatorial and Geometric Computing (context) - Mehlhorn, Naher - 1995
50 Incremental Algorithms for Minimal Length Paths (context) - Ausiello, Italiano et al. - 1991
49 An Incremental Algorithm for a Generalization of the Shortes.. - Ramalingam, Reps - 1996
40 Representation of IP Routing Policies in a Routing Registry (context) - Bates, Gerich et al. - 1994
39 Faster Shortest-path Algorithms for Planar Graphs - Klein, Rao et al. - 1994
33 Updating Distances in Dynamic Graphs (context) - Even, Gazit - 1985
15 An Empirical Study of Dynamic Graph Algorithms - Alberts, Cattaneo et al.
14 Fully Dynamic Output Bounded Single Source Shortest Path Pro.. - Frigioni, Marchetti-Spaccamela et al. - 1996
13 Experimental Analysis of Dynamic Minimum Spanning Tree Algor.. - Amato, Cattaneo et al. - 1997
9 Semi-Dynamic Shortest Paths and Breadth-First Search on Digr.. - Franciosa, Frigioni et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dsi.unive.it/~wae97/proceedings/contents.html): More
Reactive Local Search for Maximum Clique - Battiti, Protasi (1997) (Correct)
Database Learning: a Method for Empirical Algorithm Design - Goldberg, Hollinger (1997) (Correct)
A First Experimental Study of a Dynamic Transitive Closure.. - Miller, Zaroliagis (1997) (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