Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets

@article{Hedetniemi2013LinearTimeSA,
  title={Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets},
  author={Stephen T. Hedetniemi and David Pokrass Jacobs and K. E. Kennedy},
  journal={Comput. J.},
  year={2013},
  volume={56},
  pages={1381-1387}
}
A set S of nodes in a graph G = (V, E) is independent if no two nodes in S are adjacent. We present two types of self-stabilizing algorithms for finding disjoint independent sets R and B. In one type, R is maximal independent in G and B is maximal independent in the induced subgraph G[V − R]. In the second type, R is maximal independent in G[V − B] and B is maximal independent in G[V − R]. Both the central and distributed schedulers are considered. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Disjoint dominating sets in graphs

S. M. Hedetniemi, S. T. Hedetniemi, R. C. Laskar, L. Markus, P. J. Slater
Ramanujan Math. Soc. Lect. Notes, • 2008
View 1 Excerpt

Self-stabilizing algorithms for minimal dominating sets and maximal independent sets

S. M. Hedetniemi, S. T. Hedetniemi, D. P. Jacobs, P. K. Srimani
Comput. Math. Appl., • 2003
View 2 Excerpts

Similar Papers

Loading similar papers…