552 search results - page 11 / 111 » Constrained Shortest Path Computation |
COCOON
1999
Springer
14 years 1 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
COMPUTING
1998
13 years 9 months ago
1998
CCCG
2003
13 years 11 months ago
2003
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...
TKDE
2002
13 years 9 months ago
2002
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
HIPC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...