313 search results - page 20 / 63 » Shortest Paths in Distance-regular Graphs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
TCOS
2010
13 years 5 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
ICALP
2004
Springer
14 years 28 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
