Results 1  10
of
973,944
Floats, Integers, and Single Source Shortest Paths
 Journal of Algorithms
, 2000
"... Floats are ugly, but to everyone but theoretical computer scientists, they are the real thing. A linear time algorithm is presented for the undirected single source shortest paths problem with positive floating point weights. 1 Introduction The technical goal of this paper is to present a linear ti ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
Floats are ugly, but to everyone but theoretical computer scientists, they are the real thing. A linear time algorithm is presented for the undirected single source shortest paths problem with positive floating point weights. 1 Introduction The technical goal of this paper is to present a linear
Undirected Single Source Shortest Paths in Linear Time
 J. Assoc. Comput. Mach
, 1997
"... The single source shortest paths problem (SSSP) is one of the classic problems in algorithmic graph theory: given a weighted graph G with a source vertex s, find the shortest path from s to all other vertices in the graph. Since 1959 all theoretical developments in SSSP have been based on Dijkstra& ..."
Abstract

Cited by 56 (3 self)
 Add to MetaCart
The single source shortest paths problem (SSSP) is one of the classic problems in algorithmic graph theory: given a weighted graph G with a source vertex s, find the shortest path from s to all other vertices in the graph. Since 1959 all theoretical developments in SSSP have been based on Dijkstra
PARALLEL COMPLEXITY OF SINGLE SOURCE SHORTEST PATH ALGORITHMS
"... In this paper we have presented efficient parallel algorithms for all pair shortest paths problem and discussed the complexity of algorithms. The parallel complexity of 2 O n O n processors in CRCW PRAM algorithm achieves ( log) time when using () 2 model. We achieve overall complexity of SSSP is O( ..."
Abstract
 Add to MetaCart
In this paper we have presented efficient parallel algorithms for all pair shortest paths problem and discussed the complexity of algorithms. The parallel complexity of 2 O n O n processors in CRCW PRAM algorithm achieves ( log) time when using () 2 model. We achieve overall complexity of SSSP is O
Bounded Incremental SingleSource ShortestPaths
"... Abstract. We consider the problem of maintaining the distances of all vertices of a directed graph from a specific vertex, its source. We show algorithms in the bounded incremental computation (BIC) model which handle the insertion or deletion of an arc (or a batch of arcs outgoing from a shared ver ..."
Abstract
 Add to MetaCart
vertex) in O(�δ � + δlog δ) amortized time on Cyclic>0 graphs (i.e., graphs whose cycles have strictly positive lengths), where δ  and �δ � are measures of the change in the input and output. On Cyclic≥0 graphs, maintaining shortest paths is unbounded under reasonable variants of the BIC model
Floats,Integers,andSingleSourceShortestPaths
"... realthing.Alineartimealgorithmispresentedfortheundirectedsinglesourceshortest ..."
Abstract
 Add to MetaCart
realthing.Alineartimealgorithmispresentedfortheundirectedsinglesourceshortest
A randomized parallel algorithm for singlesource shortest paths
 Journal of Algorithms
, 1997
"... Abstract We give a randomized parallel algorithm for computing singlesource shortest paths in weighted digraphs. We show that the exact shortest path problem can be efficiently reduced to solving a series of approximate shortestpath subproblems. Our algorithm for the approximate shortestpath prob ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Abstract We give a randomized parallel algorithm for computing singlesource shortest paths in weighted digraphs. We show that the exact shortest path problem can be efficiently reduced to solving a series of approximate shortestpath subproblems. Our algorithm for the approximate shortestpath
A Linear Time Algorithm for Single Source Shortest Path
, 2000
"... The shortest path problem is one of the most studied problems in computer science. In this paper, we suggest an algorithm for the solution of the single source shortest path problem in O(mk+n) time, where k, the ratio of maximum and minimum weights of the edges of the graph, is bounded by a constant ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The shortest path problem is one of the most studied problems in computer science. In this paper, we suggest an algorithm for the solution of the single source shortest path problem in O(mk+n) time, where k, the ratio of maximum and minimum weights of the edges of the graph, is bounded by a
How to Employ Reverse Search in Distributed Single Source Shortest Paths
, 2001
"... A distributed algorithm for the single source shortest path problem for directed graphs with arbitrary edge lengths is proposed. The new algorithm is based on relaxations and uses reverse search for inspecting edges and thus avoids using any additional data structures. At the same time the algorithm ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A distributed algorithm for the single source shortest path problem for directed graphs with arbitrary edge lengths is proposed. The new algorithm is based on relaxations and uses reverse search for inspecting edges and thus avoids using any additional data structures. At the same time
SingleSource Shortest Paths with the Parallel Boost Graph Library
"... The Parallel Boost Graph Library (Parallel BGL) is a library of graph algorithms and data structures for distributedmemory computation on large graphs. Developed with the Generic Programming paradigm, the Parallel BGL is highly customizable, supporting various graph data structures, arbitrary verte ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
vertex and edge properties, and different communication media. In this paper, we describe the implementation of two parallel variants of Dijkstra’s singlesource shortest paths algorithm in the Parallel BGL. We also provide an experimental evaluation of these implementations using synthetic and real
Computing Single Source Shortest Paths using SingleObjective Fitness Functions
, 2009
"... Runtime analysis of evolutionary algorithms has become an important part in the theoretical analysis of randomized search heuristics. The first combinatorial problem where rigorous runtime results have been achieved is the wellknown single source shortest path (SSSP) problem. Scharnow, Tinnefeld an ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Runtime analysis of evolutionary algorithms has become an important part in the theoretical analysis of randomized search heuristics. The first combinatorial problem where rigorous runtime results have been achieved is the wellknown single source shortest path (SSSP) problem. Scharnow, Tinnefeld
Results 1  10
of
973,944