New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets

DOI10.1142/S0129054115500136zbMATH Open1320.05089OpenAlexW1948745911MaRDI QIDQ5261609FDOQ5261609

James Z. Wang, Yihua Ding, Pradip K. Srimani

Publication date: 6 July 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054115500136

zbMATH Keywords

self-stabilizationcentral daemondistributed daemonminimal weakly connected dominating set

Mathematics Subject Classification ID

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

Cites Work

• Self-stabilizing systems in spite of distributed control
• Self-stabilization of dynamic systems assuming only read/write atomicity
• A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
• A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

Cited In (3)

• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
• Self-Stabilizing Domination Algorithms

This page was built for publication: New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets

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