Deterministic distributed construction of T-dominating sets in time T
نویسندگان
چکیده
منابع مشابه
Deterministic Distributed Construction of $T$-Dominating Sets in Time $T$
A k-dominating set is a set D of nodes of a graph such that, for each node v, there exists a node w ∈ D at distance at most k from v. Our aim is the deterministic distributed construction of small T -dominating sets in time T in networks modeled as undirected n-node graphs and under the LOCAL communication model. For any positive integer T , if b is the size of a pairwise disjoint collection of...
متن کاملT-Rough Sets Based on the Lattices
The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...
متن کاملDeterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n) edge 3spanner for it in O(log n) time. This algorithm is then extended into a deterministic algorithm for computing an O(k n) edge O(k)-spanner in 2 logk−1 n time for every integer parameter k 1. This establishes that the problem of the deterministic construction of a linear (in k) ...
متن کاملOn greedy construction of connected dominating sets in wireless networks
Since no fixed infrastructure and no centralized management present in wireless networks, a Connected Dominating Set (CDS) of the graph representing the network is widely used as a virtual backbone. Constructing a minimum CDS is NP-hard. In ∗Department of Computer Science, Georgia State University, Atlanta, GA, 30303. Email: {yli}@cs.gsu.edu. †Department of Computer Science and Engineering, Uni...
متن کاملAn Explicit Construction of Optimal Dominating Sets in Grid
A dominating set in a graph G is a subset of vertices D such that every vertex in V \D is a neighbor of some vertex of D. The domination number of G is the minimum size of a dominating set of G and it is denoted by γ(G). Also, a subset D of a graph G is a [1, 2]-set if, each vertex v ∈ V \ D is adjacent to either one or two vertices in D and the minimum cardinality of [1, 2]-dominating set of G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.01.012