Results 1  10
of
1,496,172
Speeding up dynamic shortest path algorithms
 AT&T labs Research Technical Report, TD5RJ8B, Florham Park, NJ
, 2003
"... doi 10.1287/ijoc.1070.0231 ..."
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
ShortestPath Kernels on Graphs
 In Proceedings of the 2005 International Conference on Data Mining
, 2005
"... Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available by defining a kernel function on instances of graphs. Graph kernels based on walks, subtrees and cycles in graphs have bee ..."
Abstract

Cited by 61 (5 self)
 Add to MetaCart
propose graph kernels based on shortest paths. These kernels are computable in polynomial time, retain expressivity and are still positive definite. In experiments on classification of graph models of proteins, our shortestpath kernels show significantly higher classification accuracy than walk
Drawing Graphs to Speed Up ShortestPath Computations
, 2005
"... We consider the problem of (repeatedly) computing singlesource singletarget shortest paths in large, sparse graphs. Previous investigations have shown the practical usefulness of geometric speedup techniques that guarantee the correctness of the result for shortestpath computations. However, such ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We consider the problem of (repeatedly) computing singlesource singletarget shortest paths in large, sparse graphs. Previous investigations have shown the practical usefulness of geometric speedup techniques that guarantee the correctness of the result for shortestpath computations. However
Implementing Parallel ShortestPaths Algorithms
 DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, 1994
"... . We have implemented two parallel versions of the BellmanFordMoore algorithm for the singlesource shortestpaths problem. Our software is written in C and runs on the CM5 parallel supercomputer using CMMD communication primitives. We have compared the performance of our parallel programs with a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
. We have implemented two parallel versions of the BellmanFordMoore algorithm for the singlesource shortestpaths problem. Our software is written in C and runs on the CM5 parallel supercomputer using CMMD communication primitives. We have compared the performance of our parallel programs with a
Faster ShortestPath Algorithms for Planar Graphs
 STOC 94
, 1994
"... We give a lineartime algorithm for singlesource shortest paths in planar graphs with nonnegative edgelengths. Our algorithm also yields a lineartime algorithm for maximum flow in a planar graph with the source and sink on the same face. The previous best algorithms for these problems required\O ..."
Abstract

Cited by 204 (17 self)
 Add to MetaCart
lengths required \Omega\Gamma n 3=2 ) time. Our shortestpath algorithm yields an O(n 4=3 log n)time algorithm for finding a perfect matching in a planar bipartite graph. A similar improvement is obtained for maximum flow in a directed planar graph.
Engineering shortestpath algorithms for dynamic networks
"... Abstract. The problem of updating shortest paths in networks whose topology dynamically changes over time is a core functionality of many nowadays networked systems. In fact, the problem finds application in many realworld scenarios such as Internet routing and route planning in road networks. In t ..."
Abstract
 Add to MetaCart
. In these scenarios, shortestpath data are stored in different ways and have to be updated whenever the underlying graph, representing the network, undergoes dynamic updates. This paper provides a toplevel overview of [13], where new dynamic shortestpath algorithms for various realworld applications
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 144 (1 self)
 Add to MetaCart
incremental algorithm for the singlesource shortestpath problem with positive edge lengths. The aspect of our work that distinguishes it from other work on the dynamic shortestpath problem is its ability to handle "multiple heterogeneous modifications": between updates, the input graph is allowed
Results 1  10
of
1,496,172