Sciweavers

31 search results - page 3 / 7
» Kinetic connectivity for unit disks
Sort
View
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 10 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
13 years 8 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
APWEB
2006
Springer
14 years 3 days ago
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
Ding-Zhu Du, My T. Thai, Yingshu Li, Dan Liu, Shiw...
ECAL
2007
Springer
14 years 2 months ago
Measuring Entropy in Embodied Neural Agents with Homeostasic Units: A Link Between Complexity and Cybernetics
Abstract. We present a model of a recurrent neural network with homeostasic units, embodied in a minimalist articulated agent with a single link and joint. The configuration of th...
Jorge Simão
ICDCS
2010
IEEE
13 years 8 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...