A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets

DOI10.1016/j.tcs.2015.06.004zbMath1331.05169OpenAlexW643669290MaRDI QIDQ501004

Stephen T. Hedetniemi, David P. Jacobs, K. E. Kennedy

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.004

zbMATH Keywords

maximal independent setminimal dominating setself-stabilizing algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Self-stabilizing algorithm for two disjoint minimal dominating sets ⋮ Self-Stabilizing Domination Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• A characterization of graphs with disjoint dominating and paired-dominating sets
• Distance-\(k\) knowledge in self-stabilizing algorithms
• Remarks about disjoint dominating sets
• A belated proof of self-stabilization
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• Disjoint independent dominating sets in graphs
• Trees with two disjoint minimum independent dominating sets
• Self-stabilizing systems in spite of distributed control

This page was built for publication: A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets