Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
نویسندگان
چکیده
منابع مشابه
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
We propose two distributed algorithms to maintain, respectively, a maximal matching and a maximal independent set in a given ad hoc network; our algorithms are fault tolerant (reliable) in the sense that the algorithms can detect occasional link failures and/or new link creations in the network (due to mobility of the hosts) and can readjust the global predicates. We provide time complexity ana...
متن کاملMinimal closed sets and maximal closed sets
Some properties of minimal open sets and maximal open sets are studied in [1, 2]. In this paper, we define dual concepts of them, namely, maximal closed set and minimal closed set. These four types of subsets appear in finite spaces, for example. More generally, minimal open sets and maximal closed sets appear in locally finite spaces such as the digital line. Minimal closed sets and maximal op...
متن کاملMinimum connected dominating sets and maximal independent sets in unit disk graphs
In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the minimum connected dominating set are based on the construction of a maximal independent set. The relation between the sizemis(G) of a maximum independent set and the size cds(G) of a minimum connected dominating set in the same graph G pl...
متن کاملEnumeration of Minimal Dominating Sets and Variants
In this paper, we are interested in the enumeration of minimal dominating sets in graphs. A polynomial delay algorithm with polynomial space in split graphs is presented. We then introduce a notion of maximal extension (a set of edges added to the graph) that keeps invariant the set of minimal dominating sets, and show that graphs with extensions as split graphs are exactly the ones having chor...
متن کاملSelf-Stabilizing Maximal K-Dependent Sets In Linear Time
In a graph or network G = (V;E), a set S V is k-dependent if no node in S has more than k neighbors in S. We show that for each k 0 there is a self-stabilizing algorithm that identi es a maximal k-dependent set, and stabilizes in O(m + n) time. An interesting by-product of our paper is the new result that in any graph there exists a set that is both maximal k-dependent and minimal (k+1)-dominat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2003
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(03)90143-x