552 search results - page 35 / 111 » Constrained Shortest Path Computation |
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
139
click to vote
JCO
2006
15 years 2 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
126
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
244
click to vote
Presentation
In robotic navigation, path planning is aimed at getting the optimum collision-free
path between a starting and target locations. The optimality criterion depends on
the surround...
154
click to vote
EDBT
2012
ACM
13 years 5 months ago
2012
ACM
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...