Results 1  10
of
7,851
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem
 ACM Jounal of Experimental Algorithmics
, 1997
"... In this paper we propose the first experimental study of the fully dynamic single source shortest paths problem on directed graphs with positive real edge weights. In particular, we perform an experimental analysis of three different algorithms: Dijkstra's algorithm, and the two output bound ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
In this paper we propose the first experimental study of the fully dynamic single source shortest paths problem on directed graphs with positive real edge weights. In particular, we perform an experimental analysis of three different algorithms: Dijkstra's algorithm, and the two output
Practical Efficiency of the LinearTime Algorithm for the Single Source Shortest Path Problem
 Journal of the Operations Research Society of Japan
"... Abstract Thorup's lineartime algorithm for the single source shortest path problem consists of two phases: a construction phase of constructing a data structure suitable for a shortest path search from a given query source S; and a search phase of finding shortest paths from the query source ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract Thorup's lineartime algorithm for the single source shortest path problem consists of two phases: a construction phase of constructing a data structure suitable for a shortest path search from a given query source S; and a search phase of finding shortest paths from the query source
A simple parallel algorithm for the singlesource shortest path problem on planar digraphs
, 2000
"... We present a simple parallel algorithm for the singlesource shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n 2 = +n 1& = ) log n) time, performing O(n 1+ = log n) work for any 0<=<1 2. Th ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We present a simple parallel algorithm for the singlesource shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n 2 = +n 1& = ) log n) time, performing O(n 1+ = log n) work for any 0<=<1 2
A Tight Analysis of the (1 + 1)EA for the Single Source Shortest Path Problem
"... Abstract — We conduct a rigorous analysis of the (1 + 1) evolutionary algorithm for the single source shortest path problem proposed by Scharnow, Tinnefeld and Wegener (Journal of Mathematical Modelling and Algorithms, 2004). We prove a tight bound of Θ(n 2 max{log(n), ℓ}) on the optimization time, ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract — We conduct a rigorous analysis of the (1 + 1) evolutionary algorithm for the single source shortest path problem proposed by Scharnow, Tinnefeld and Wegener (Journal of Mathematical Modelling and Algorithms, 2004). We prove a tight bound of Θ(n 2 max{log(n), ℓ}) on the optimization time
A Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths
, 2010
"... In this paper, we propose an efficient method for implementing Dijkstra’s algorithm for the Single Source Shortest Path Problem (SSSPP) in a graph with positively lengthed edges, and where there are few distinct lengths. The SSSPP is one of the most widely studied problems in theoretical computer sc ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
In this paper, we propose an efficient method for implementing Dijkstra’s algorithm for the Single Source Shortest Path Problem (SSSPP) in a graph with positively lengthed edges, and where there are few distinct lengths. The SSSPP is one of the most widely studied problems in theoretical computer
International Journal of Computer Science and Security (IJCSS), Volume (6) : Issue (4) : 2012 288 Comparative Analysis of Algorithms for Single Source Shortest Path Problem
"... The single source shortest path problem is one of the most s t u d i e d problem in algorithmic graph theory. Single Source Shortest Path is the problem in which we have to find shortest paths from a source vertex v to all other vertices in the graph. A number of algorithms have been proposed for th ..."
Abstract
 Add to MetaCart
The single source shortest path problem is one of the most s t u d i e d problem in algorithmic graph theory. Single Source Shortest Path is the problem in which we have to find shortest paths from a source vertex v to all other vertices in the graph. A number of algorithms have been proposed
Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract)
 In ACMSIAM Symposium on Discrete Algorithms
"... ) Abstract We consider the problem of maintaining the distances and the shortest paths from a single source in either a directed or an undirected graph with positive real edge weights, handling insertions, deletions and cost updates of edges. We propose fully dynamic algorithms with optimal space ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
) Abstract We consider the problem of maintaining the distances and the shortest paths from a single source in either a directed or an undirected graph with positive real edge weights, handling insertions, deletions and cost updates of edges. We propose fully dynamic algorithms with optimal space
Incremental ShortestPath Problem
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract
 Add to MetaCart
The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also
An Incremental Algorithm for a Generalization of the ShortestPath Problem
, 1992
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract

Cited by 139 (1 self)
 Add to MetaCart
The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also
Results 1  10
of
7,851