268 search results - page 23 / 54 » Finding the k Shortest Paths |
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
IEEEMSP
2002
IEEE
14 years 17 days ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
ACRI
2006
Springer
14 years 1 months ago
2006
Springer
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...
CAV
2001
Springer
14 years 4 days ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
DIAGRAMS
2006
Springer
13 years 11 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...