Linear-time self-stabilizing algorithms for minimal domination in graphs

DOI10.1007/978-3-642-45278-9_11MaRDI QIDQ2870021zbMATH OpenOpenAlexFDO

Authors Well Y. Chiu, Chiuyuan Chen

Publication date 17 January 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45278-9_11

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
• New self-stabilizing algorithms for minimal weakly connected dominating sets
• Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph

Cited in

(11)

• A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
• A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
• Self-Stabilizing Domination Algorithms
• scientific article; zbMATH DE number 2061538 (Why is no real title available?)
• Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
• Enabling minimal dominating set in highly dynamic distributed systems
• New self-stabilizing algorithms for minimal weakly connected dominating sets
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

This page was built for publication: Linear-time self-stabilizing algorithms for minimal domination in graphs

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