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

DOI10.1016/J.TCS.2015.06.004zbMATH Open1331.05169OpenAlexW643669290MaRDI QIDQ501004FDOQ501004

Authors: 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

Recommendations

• Self-stabilizing algorithm for two disjoint minimal dominating sets
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
• Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
• A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model

zbMATH Keywords

maximal independent setminimal dominating setself-stabilizing algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph theoretic methods in multiagent networks
• Self-stabilization
• Title not available (Why is that?)
• Self-stabilizing systems in spite of distributed control
• A note on graphs with disjoint dominating and total dominating sets
• Title not available (Why is that?)
• Remarks about disjoint dominating sets
• Distance-\(k\) knowledge in self-stabilizing algorithms
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Trees with two disjoint minimum independent dominating sets
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• Disjoint independent dominating sets in graphs
• A belated proof of self-stabilization
• Title not available (Why is that?)
• A characterization of graphs with disjoint dominating and paired-dominating sets

Cited In (3)

• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Self-stabilizing algorithm for two disjoint minimal dominating sets
• Self-Stabilizing Domination Algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501004)