A linear time algorithm for minimum equitable dominating set in trees
نویسندگان
چکیده
Let G = (V, E) be a graph. A subset De of V is said to an equitable dominating set if for every v ∈ \ there exists u such that uv E and |deg(u) − deg(v)| ≤ 1, where, deg(u) deg(v) denote the degree vertices respectively. An with minimum cardinality called its domination number it denoted by γe. The problem finding in general graphs NP-complete. In this paper, we give linear time algorithm determine tree.
منابع مشابه
Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set
Using connected dominating set (CDS) to serve as a virtual backbone in a wireless networks can save energy and reduce interference. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone has some fault-tolerance. A k-connected m-fold dominating set ((k,m)-CDS) of a graph G is a node set D such that every node in V \ D has at least m neighbor...
متن کاملMinimum Dominating Set for a Point Set in $\IR^2$
In this article, we consider the problem of computing minimum dominating set for a given set S of n points in R. Here the objective is to find a minimum cardinality subset S of S such that the union of the unit radius disks centered at the points in S covers all the points in S. We first propose a simple 4-factor and 3-factor approximation algorithms in O(n log n) and O(n logn) time respectivel...
متن کاملA Linear-Time Self-Stabilizing Algorithm for the Minimal 2-Dominating Set Problem in General Networks
Kamei and Kakugawa have recently proposed a self-stabilizing algorithm for the minimal k-dominating set problem. Their algorithm is a general form of the maximalindependent-set algorithm proposed by Shukla et al. The results in their paper are for any tree network that assumes Dijkstra’s central demon model. In particular, the worstcase stabilization time is claimed to be O(n), where n is the n...
متن کاملGraph Neural Network for Minimum Dominating Set
The dominating set concept in graphs has been used in many applications. In large graphs finding the minimum dominating set is difficult. The minimum dominating set problem in graphs seek a set D of minimum number of vertices such that each vertex of the graph is either in D or adjacent to a vertex in D. In a graph on n nodes if there is a single node of degree n-1 then that single node forms a...
متن کاملMinimum Information Dominating Set for Opinion Sampling
We consider the problem of inferring the opinions of a social network through strategically sampling a minimum subset of nodes by exploiting correlations in node opinions. We first introduce the concept of information dominating set (IDS). A subset of nodes in a given network is an IDS if knowing the opinions of nodes in this subset is sufficient to infer the opinion of the entire network. We f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones
سال: 2021
ISSN: ['0716-0917', '0717-6279']
DOI: https://doi.org/10.22199/issn.0717-6279-4552