Fast Distributed Construction of Small k-Dominating Sets and Applications

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.28, Iss.1, 1998-07, pp. : 40-66

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Dominating Sets for Convex Functions with Some Applications

By Carrizosa E. Frenk J.B.G.

Journal of Optimization Theory and Applications, Vol. 96, Iss. 2, 1998-02 ,pp. : 281-295

Springer Publishing Company

Access to resources Recommend Favorite

A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets

By Henning Michael A. Southey Justin

Quaestiones Mathematicae, Vol. 32, Iss. 1, 2009-03 ,pp. : 119-129

Taylor & Francis Ltd

Access to resources Recommend Favorite

Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets

By Guha S. Khuller S.

Information and Computation, Vol. 150, Iss. 1, 1999-04 ,pp. : 57-74

Academic Press

Access to resources Recommend Favorite

Vertices contained in all minimum paired-dominating sets of a tree

By Chen Xue-gang

Czechoslovak Mathematical Journal, Vol. 57, Iss. 1, 2007-03 ,pp. : 407-417

Springer Publishing Company

Access to resources Recommend Favorite

Constructing weakly connected dominating set for secure clustering in distributed sensor network

By Du Hongjie

Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. : 301-307

Springer Publishing Company

Access to resources Recommend Favorite