Distributed Computing - IWDC 2003

DOI10.1007/b94926zbMath1205.68081OpenAlexW43760335MaRDI QIDQ5191414

Stephen T. Hedetniemi, Zhen-Yu Xu, Pradip K. Srimani, Wayne Goddard

Publication date: 6 August 2009

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

Full work available at URL: https://doi.org/10.1007/b94926

Mathematics Subject Classification ID

Network protocols (68M12) Distributed algorithms (68W15)

Related Items (8)

Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler ⋮ Self-stabilizing 2-minimal dominating set algorithms based on loop composition ⋮ Brief announcement: Fully lattice linear algorithms ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon ⋮ Robust self-stabilizing weight-based clustering algorithm ⋮ Self-Stabilizing Domination Algorithms ⋮ Self-stabilizing distributed algorithm for local mutual inclusion

This page was built for publication: Distributed Computing - IWDC 2003