Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs

DOI10.1007/978-3-642-45278-9_11zbMath1408.68114OpenAlexW72582017MaRDI QIDQ2870021

Well Y. Chiu, Chiuyuan Chen

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_11

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 systems (68M14) Distributed algorithms (68W15)

Related Items (2)

A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon ⋮ Self-Stabilizing Domination Algorithms

This page was built for publication: Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs