Sciweavers

763 search results - page 4 / 153
» Engineering Shortest Path Algorithms
Sort
View
JCP
2007
111views more  JCP 2007»
13 years 7 months ago
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele ...
PUK
2003
13 years 9 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
ICFEM
2000
Springer
13 years 11 months ago
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Tetsuo Tamai
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 7 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim