59 search results - page 5 / 12 » An External Memory Data Structure for Shortest Path Queries |
139
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
131
Voted
SPIRE
2009
Springer
15 years 10 months ago
2009
Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
123
Voted
ICPP
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
128
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
155
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...