78 search results - page 1 / 16 » A near-linear time algorithm for computing replacement paths... |
SODA
2008
ACM
13 years 5 months ago
2008
ACM
SODA
2010
ACM
14 years 1 months ago
2010
ACM
SIAMCOMP
1998
13 years 4 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
CORR
2012
Springer
12 years 1 days ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
COSIT
2003
Springer
13 years 9 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...