Publication Date:
2013-10-30
Description:
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.
Print ISSN:
0010-4620
Electronic ISSN:
1460-2067
Topics:
Computer Science