An anonymous self-stabilizing algorithm for 1-maximal independent set in trees

Authors:
Zhengnan Shi;Wayne Goddard;Stephen T. Hedetniemi
Affiliations:
Department of Computer Science, Clemson University, Clemson, SC;Department of Computer Science, Clemson University, Clemson, SC;Department of Computer Science, Clemson University, Clemson, SC
Venue:
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Year:
2004

Citing 7
Cited 6

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
On generalised minimal domination parameters for paths

Discrete Mathematics - Topics on domination
A self-stabilizing algorithm for maximal matching

Information Processing Letters
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

SIAM Journal on Computing
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Introduction to Distributed Algorithms

Introduction to Distributed Algorithms

Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
A self-stabilizing algorithm for the minimum color sum of a graph

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
A distributed algorithm for a b-coloring of a graph

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
A self-stabilizing algorithm to maximal 2-packing with improved complexity

Information Processing Letters
An incremental distributed algorithm for a partial Grundy coloring of graphs

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an anonymous, constant-space, self-stabilizing algorithm for finding a 1-maximal independent set in tree graphs (and some rings). We show that the algorithm converges in O(n2) moves under any central daemon (one that at each time-step selects one of the privileged nodes to move).