Fast, silent self-stabilizing distance-\(k\) independent dominating set construction

DOI10.1016/J.IPL.2014.04.013zbMath1371.68038OpenAlexW2030923290MaRDI QIDQ2015150

Colette Johnen

Publication date: 23 June 2014

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

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

zbMATH Keywords

fault tolerancedistributed computingself-stabilizationdistance-\(k\) dominating setdistance-\(k\) independent dominating setdistance-\(k\) independent set

Mathematics Subject Classification ID

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

Related Items (3)

A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem ⋮ Self-stabilizing silent disjunction in an anonymous network ⋮ Self-Stabilizing Domination Algorithms

Cites Work

• A self-stabilizing \(k\)-clustering algorithm for weighted graphs

This page was built for publication: Fast, silent self-stabilizing distance-\(k\) independent dominating set construction