Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs

DOI10.1142/S0129054115500422zbMath1332.68174OpenAlexW2206986926MaRDI QIDQ3455752

Brahim Neggazi, Nabil Guellati, Hamamache Kheddouci, Mohammed Haddad

Publication date: 11 December 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/s0129054115500422

zbMATH Keywords

independent setdominating setfault-tolerancedistributed algorithmself-stabilizationweak dominationindependent strong dominating-set

Mathematics Subject Classification ID

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

Related Items (2)

A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ Self-Stabilizing Domination Algorithms

Cites Work

• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Strong weak domination and domination balance in a graph
• On parameters related to strong and weak domination in graphs
• 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
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
• Self-stabilizing systems in spite of distributed control
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS

This page was built for publication: Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs