4865 search results - page 649 / 973 » The Complexity of Graph Connectivity |
163
click to vote
FSTTCS
2009
Springer
16 years 22 days ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
136
click to vote
MODELS
2009
Springer
16 years 21 days ago
2009
Springer
We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one o...
157
Voted
CDC
2008
IEEE
16 years 19 days ago
2008
IEEE
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...
143
click to vote
FOCS
2008
IEEE
16 years 18 days ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
164
Voted
GLOBECOM
2008
IEEE
16 years 18 days ago
2008
IEEE
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....