Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs

DOI10.1016/J.IPL.2014.02.002MaRDI QIDQ2446589zbMATH OpenOpenAlexFDO

Authors Yacine Belhoul, Saïd Yahiaoui, H. Kheddouci

Publication date 17 April 2014

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

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

zbMATH Keywords

graph algorithmsminimal total dominating set\(k\)-tuple total dominating setdistributed self-stabilizing algorithmsminimal total \(k\)-domination

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2061538
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
• Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
• Linear-time self-stabilizing algorithms for minimal domination in graphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1919504 (Why is no real title available?)
• A self-stabilizing algorithm for optimally efficient sets in graphs
• A survey of selected recent results on total domination in graphs
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• An efficient self-stabilizing distance-2 coloring algorithm
• Distance-\(k\) knowledge in self-stabilizing algorithms
• Efficient transformation of distance-2 self-stabilizing algorithms
• High Performance Computing - HiPC 2003
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
• Self-stabilization
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• Self-stabilizing systems in spite of distributed control
• Total domination in graphs
• Total domination in graphs
• \(k\)-tuple total domination in cross products of graphs
• k-tuple total domination in graphs

Cited in

(23)

• Self-Stabilizing Domination Algorithms
• scientific article; zbMATH DE number 3987328 (Why is no real title available?)
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• Approximation algorithms for the total dominating set problem
• A self-stabilizing algorithm for optimally efficient sets in graphs
• scientific article; zbMATH DE number 2061538 (Why is no real title available?)
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
• Self-stabilizing minimal global offensive alliance algorithm with safe convergence in an arbitrary graph
• A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• Linear-time self-stabilizing algorithms for minimal domination in graphs
• New self-stabilizing algorithms for minimal weakly connected dominating sets
• A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
• A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
• Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
• A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
• Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
• Self-stabilizing algorithm for two disjoint minimal dominating sets
• Distributed Computing - IWDC 2003
• A self-stabilizing algorithm for edge monitoring in wireless sensor networks

This page was built for publication: Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs

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