425 search results - page 35 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
ESA
2004
Springer
14 years 2 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
CORR
2008
Springer
13 years 8 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 ...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— To enable real-time and robust message delivery, the highly mobile Vehicular Ad Hoc Networks (VANETs) call for comprehensive investigation on the dynamic power control effects ...
HPDC
2006
IEEE
14 years 2 months ago
2006
IEEE
As the size of distributed systems keeps growing, the peer to peer communication paradigm has been identified as the key to scalability. Peer to peer overlay networks are charact...
ADHOCNOW
2008
Springer
14 years 3 months ago
2008
Springer
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...