Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler-Reference-Cited by-同舟云学术

Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler

Published:2007-07 Issue:3 Volume:103 Page:88-93
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Turau Volker

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference10 articles.

1. Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks;Alzoubi;International Journal of Foundations of Computer Science,2003

2. Self-stabilizing local mutual exclusion and daemon refinement;Beauquier;Chicago Journal of Theoretical Computer Science,2002

3. Self stabilizing systems in spite of distributed control;Dijkstra;Comm. ACM,1974

4. Self-Stabilization;Dolev,2000

5. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks, in: Proc. Int. Parallel and Distributed Processing Symposium (2003)

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

1. Luby's MIS algorithms made self-stabilizing;Information Processing Letters;2025-02

2. Resource efficient stabilization for local tasks despite unknown capacity links;Theoretical Computer Science;2024-10

3. A self‐stabilizing distributed algorithm for the 1‐MIS problem under the distance‐3 model;Concurrency and Computation: Practice and Experience;2024-09-09

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

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