DC   2010
Wall of Fame | Most Viewed DC-2010 Paper
13 years 7 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source208
2Download preprint from source169
3Download preprint from source155
4Download preprint from source154
5Download preprint from source153
6Download preprint from source152
7Download preprint from source135
8Download preprint from source126
9Download preprint from source124
10Download preprint from source123
11Download preprint from source110
12Download preprint from source109
13Download preprint from source109
14Download preprint from source99