Sciweavers

367 search results - page 54 / 74
» Set connectivity problems in undirected graphs and the direc...
Sort
View
PODC
2012
ACM
11 years 9 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 7 months ago
Graph-Constrained Group Testing
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Ve...
INFOCOM
2002
IEEE
14 years 9 days ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
JCO
2010
67views more  JCO 2010»
13 years 5 months ago
Galaxy cutsets in graphs
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
Nicolas Sonnerat, Adrian Vetta
INFOCOM
2007
IEEE
14 years 1 months ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...