108 search results - page 10 / 22 » Constant-Work-Space Algorithm for a Shortest Path in a Simpl... |
117
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
117
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
111
click to vote
SWAT
1998
Springer
15 years 7 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
142
click to vote
CCCG
2008
15 years 4 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
112
click to vote
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...