Results 1  10
of
11
Experimental analysis of dynamic all pairs shortest path algorithms
 In Proceedings of the fifteenth annual ACMSIAM symposium on Discrete algorithms
, 2004
"... 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 and of Demetrescu and Italiano, and compare them to the dynamic algorithm of Ramalingam and Reps and to stat ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
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 and of Demetrescu and Italiano, and compare them to the dynamic algorithm of Ramalingam and Reps and to static algorithms on random, realworld and hard instances. Our experimental data suggest that some of the dynamic algorithms and their algorithmic techniques can be really of practical value in many situations. 1
Lifelong Planning A*
, 2005
"... Heuristic search methods promise to find shortest paths for pathplanning problems faster than uninformed search methods. Incremental search methods, on the other hand, promise to find shortest paths for series of similar pathplanning problems faster than is possible by solving each pathplanning p ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
Heuristic search methods promise to find shortest paths for pathplanning problems faster than uninformed search methods. Incremental search methods, on the other hand, promise to find shortest paths for series of similar pathplanning problems faster than is possible by solving each pathplanning problem from scratch. In this article, we develop Lifelong Planning A * (LPA*), an incremental version of A * that combines ideas from the artificial intelligence and the algorithms literature. It repeatedly finds shortest paths from a given start vertex to a given goal vertex while the edge costs of a graph change or vertices are added or deleted. Its first search is the same as that of a version of A * that breaks ties in favor of vertices with smaller gvalues but many of the subsequent searches are potentially faster because it reuses those parts of the previous search tree that are identical to the new one. We present analytical results that demonstrate its similarity to A * and experimental results that demonstrate its potential advantage in two different domains if the pathplanning problems change only slightly and the changes are close to the goal.
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
, 2004
"... We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has marginally inferior time complexity compared with the best previously known result, we find that its simplicity lead ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has marginally inferior time complexity compared with the best previously known result, we find that its simplicity leads to better performance in practice. In addition, we provide an empirical comparison against three alternatives over a large number of random DAG's. The results show our algorithm is the best for sparse graphs and, surprisingly, that an alternative with poor theoretical complexity performs marginally better on dense graphs.
Speeding up dynamic shortest path algorithms
 AT&T labs Research Technical Report, TD5RJ8B, Florham Park, NJ
, 2003
"... doi 10.1287/ijoc.1070.0231 ..."
Online Algorithms for Topological Order and Strongly Connected Components
, 2003
"... We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and obtain a marginally improved complexity result over the previously known O(#log#). In addition, we provide an empirical compari ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and obtain a marginally improved complexity result over the previously known O(#log#). In addition, we provide an empirical comparison against three existing solutions using random DAG's. The results show our algorithm to out perform the others on sparse graphs. Finally, we show how the algorithm can be extended to identify strongly connected components online.
An Experimental Study of Dynamic Algorithms for Transitive Closure
 ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS
, 2000
"... We perform an extensive experimental study of several dynamic algorithms for transitive closure. In particular, we implemented algorithms given by Italiano, Yellin, Cicerone et al., and two recent randomized algorithms by Henzinger and King. We propose a netuned version of Italiano's algorithms ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We perform an extensive experimental study of several dynamic algorithms for transitive closure. In particular, we implemented algorithms given by Italiano, Yellin, Cicerone et al., and two recent randomized algorithms by Henzinger and King. We propose a netuned version of Italiano's algorithms as well as a new variant of them, both of which were always faster than any of the other implementations of the dynamic algorithms. We also considered simpleminded algorithms that were easy to implement and likely to be fast in practice. We tested and compared the above implementations on random inputs, on nonrandom inputs that are worstcase inputs for the dynamic algorithms, and on an input motivated by a realworld graph.
Shortest Path Trees Computation in Dynamic Graphs
, 2005
"... Let G =(V,E,w) be a simple digraph, in which all edge weights are nonnegative real numbers. Let G ′ be obtained from G by the application of a set of edge weight updates to G. Lets∈V, and let Ts and T ′ s be a Shortest Path Tree (SPT) rooted at s in G and G ′ , respectively. The Dynamic Shortest Pa ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Let G =(V,E,w) be a simple digraph, in which all edge weights are nonnegative real numbers. Let G ′ be obtained from G by the application of a set of edge weight updates to G. Lets∈V, and let Ts and T ′ s be a Shortest Path Tree (SPT) rooted at s in G and G ′ , respectively. The Dynamic Shortest Path (DSP) problem is to compute T ′ s from Ts. For the DSP problem, we correct and extend a few existing SPT algorithms to handle multiple edge weight updates. We prove that these extended algorithms are correct. The complexity of these algorithms is also analyzed. To evaluate the proposed algorithms, we compare them with the wellknown static Dijkstra algorithm. Extensive experiments are conducted with both reallife and artificial data sets. The reallife data are road system graphs obtained from the Connecticut road system and are relatively sparse. The artificial data are randomly generated graphs and are relatively dense. The experimental results suggest the most appropriate algorithms to be used under different circumstances.
www.stacsconf.org SHORTEST PATHS AVOIDING FORBIDDEN SUBPATHS
"... Abstract. In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest st path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We call ea ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest st path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We call each path in X an exception, and our desired path a shortest exception avoiding path. We formulate a new version of the problem where the algorithm has no a priori knowledge of X, and finds out about an exception x ∈ X only when a path containing x fails. This situation arises in computing shortest paths in optical networks. We give an algorithm that finds a shortest exception avoiding path in time polynomial in G  and X. The main idea is to run Dijkstra’s algorithm incrementally after replicating vertices when an exception is discovered. 1.
An Experimental Study of Algorithms for Fully Dynamic Transitive Closure ∗
, 2007
"... We have conducted an extensive experimental study on algorithms for fully dynamic transitive closure. We have implemented the recent fully dynamic algorithms by King [20], Roditty ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We have conducted an extensive experimental study on algorithms for fully dynamic transitive closure. We have implemented the recent fully dynamic algorithms by King [20], Roditty
A Note on Models, Algorithms, and Data Structures for Dynamic Communications Networks
, 2002
"... New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. Modeling such dynamics, and designing algorithms that take it into account, received considerable attention recently. In this note, we ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. Modeling such dynamics, and designing algorithms that take it into account, received considerable attention recently. In this note, we discuss a formal generalization of dynamic graphs, the evolving graphs, which aims at harnessing the complexity of an evolving setting as yielded by dynamic communication networks. We argue that evolving graphs are of great help when dealing with xedschedule networks. Moreover, we show how to exploit our model with networks where short time prediction is available.