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

DOI10.1016/j.ipl.2009.03.013zbMath1213.68695OpenAlexW2077583978MaRDI QIDQ989481

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

fault tolerancegraph algorithmsdistributed algorithmsself-stabilizing algorithms

Mathematics Subject Classification ID

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

Related Items (3)

Finding minimum weight connected dominating set in stochastic graph based on learning automata ⋮ Self-Stabilizing Domination Algorithms ⋮ New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets

Cites Work

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

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