40 search results - page 6 / 8 » Faster shortest-path algorithms for planar graphs |
102
click to vote
SIROCCO
2001
15 years 1 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
100
click to vote
MOBIHOC
2005
ACM
15 years 11 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
107
click to vote
PC
2010
14 years 10 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
72
Voted
STOC
1994
ACM
15 years 3 months ago
1994
ACM