Back to Search
Start Over
Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets.
- Source :
-
Computer Journal . Nov2013, Vol. 56 Issue 11, p1381-1387. 7p. - Publication Year :
- 2013
-
Abstract
- 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. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00104620
- Volume :
- 56
- Issue :
- 11
- Database :
- Academic Search Index
- Journal :
- Computer Journal
- Publication Type :
- Academic Journal
- Accession number :
- 91723190
- Full Text :
- https://doi.org/10.1093/comjnl/bxs128