4565 search results - page 439 / 913 » Time Optimal Self-Stabilizing Algorithms |
136
Voted
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
134
click to vote
STOC
1994
ACM
15 years 8 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
122
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
158
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
-- This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm...
134
click to vote
DCOSS
2008
Springer
15 years 6 months ago
2008
Springer
Sensor networks can be viewed as large distributed databases, and SQL-like high-level declarative languages can be used for data and information retrieval. Energy constraints make ...