SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS

DOI10.1142/S0129626413500011zbMath1284.05288OpenAlexW2100136595MaRDI QIDQ5408358

Alice A. McRae, K. E. Kennedy, Stephen T. Hedetniemi, Sandra M. Hedetniemi

Publication date: 10 April 2014

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626413500011

zbMATH Keywords

self-stabilizing algorithmdisjoint dominating setsunfriendly partitions

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Client-server and cost effective sets in graphs, Self-Stabilizing Domination Algorithms, Algorithms and Complexity of Alliances in Graphs, Stabilization Time in Weighted Minority Processes

Cites Work

• Unfriendly partitions of a graph
• Distance-\(k\) knowledge in self-stabilizing algorithms
• A belated proof of self-stabilization
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Algorithmic approach to the satisfactory graph partitioning problem
• \(\alpha\)-domination
• The satisfactory partition problem
• Self-stabilizing systems in spite of distributed control
• Some remarks on alpha-domination
• Offensive alliances in graphs