1172 search results - page 57 / 235 » Path Algorithms on Regular Graphs |
124
click to vote
EMMCVPR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
106
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
89
Voted
STOC
2003
ACM
16 years 21 days ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
SIAMDM
2008
15 years 10 days ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
100
click to vote
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...