49 search results - page 9 / 10 » On Shortest Disjoint Paths in Planar Graphs |
DIALM
2003
ACM
13 years 10 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
MOBIHOC
2005
ACM
14 years 4 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...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
OPODIS
2008
13 years 6 months ago
2008
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
FOCS
2009
IEEE
14 years 1 days ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...