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 ...
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...
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...
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...
—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...