SELF-STABILIZING GRAPH PROTOCOLS-Reference-Cited by-同舟云学术

SELF-STABILIZING GRAPH PROTOCOLS

Published:2008-03 Issue:01 Volume:18 Page:189-199
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

GODDARD WAYNE¹,HEDETNIEMI STEPHEN T.¹,JACOBS DAVID P.¹,SRIMANI PRADIP K.¹,XU ZHENYU¹

Affiliation:

1. School of Computing, Clemson University, Clemson SC 29634, USA

Abstract

We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129626408003314

Reference7 articles.

1. Self-stabilizing topology maintenance protocols for high-speed networks

2. Monographs and Textbooks in Pure and Applied Mathematics;Haynes T. W.,1998

3. Self-stabilizing systems in spite of distributed control

4. Self-Stabilization

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Eventually lattice-linear algorithms;Journal of Parallel and Distributed Computing;2024-03

2. Self-stabilizing 2-minimal dominating set algorithms based on loop composition;Theoretical Computer Science;2024-02

3. ACapDS: An Energy-Efficient and Fault-Tolerant Distributed Capacitated Dominating Set Algorithm for Industrial IoT;IEEE Access;2024

4. Inducing Lattices in Non-Lattice-Linear Problems;2023 42nd International Symposium on Reliable Distributed Systems (SRDS);2023-09-25

5. A self‐stabilizing distributed algorithm for the bounded lattice domination problems under the distance‐2 model;Concurrency and Computation: Practice and Experience;2023-09-11