A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

DOI10.1016/J.IPL.2009.03.013zbMATH Open1213.68695OpenAlexW2077583978MaRDI QIDQ989481FDOQ989481

Volker Turau, Bernd Hauck

Publication date: 20 August 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.013

zbMATH Keywords

distributed algorithmsgraph algorithmsfault toleranceself-stabilizing algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cites Work

• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilization
• On weakly connected domination in graphs
• Distance-\(k\) knowledge in self-stabilizing algorithms
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• Title not available (Why is that?)
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS

Cited In (8)

• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Brief announcement: Fully lattice linear algorithms
• A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem
• An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
• New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets
• A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
• Finding minimum weight connected dominating set in stochastic graph based on learning automata
• Self-Stabilizing Domination Algorithms

   Recommendations

• New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets 👍 👎
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets 👍 👎
• 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 👍 👎
• A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon 👍 👎

This page was built for publication: A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

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