763 search results - page 1 / 153 » Engineering Shortest Path Algorithms |
AAIM
2008
Springer
13 years 6 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
WEA
2004
Springer
13 years 10 months ago
2004
Springer
WADS
2009
Springer
13 years 11 months ago
2009
Springer
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
ITCC
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the...
JDA
2006
13 years 4 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...