Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition.
- Published in:
- Distributed Computing, 2010, v. 22, n. 5/6, p. 363, doi. 10.1007/s00446-009-0088-2
- By:
- Publication type:
- Article
Works matching IS 01782770 AND DT 2010 AND VI 22 AND IP 5/6
Results: 7
1
2
An optimal maximal independent set algorithm for bounded-independence graphs.
- Published in:
- Distributed Computing, 2010, v. 22, n. 5/6, p. 349, doi. 10.1007/s00446-010-0097-1
- By:
- Publication type:
- Article
3
Special issue on PODC 2008.
- Published in:
- Distributed Computing, 2010, v. 22, n. 5/6, p. 285, doi. 10.1007/s00446-010-0109-1
- By:
- Publication type:
- Article
4
Adaptive progress: a gracefully-degrading liveness property.
- Published in:
- Distributed Computing, 2010, v. 22, n. 5/6, p. 303, doi. 10.1007/s00446-010-0106-4
- By:
- Publication type:
- Article
5
The impact of randomization in smoothing networks.
- Published in:
- Distributed Computing, 2010, v. 22, n. 5/6, p. 381, doi. 10.1007/s00446-009-0087-3
- By:
- Publication type:
- Article
6
Anti- Ω: the weakest failure detector for set agreement.
- Published in:
- Distributed Computing, 2010, v. 22, n. 5/6, p. 335, doi. 10.1007/s00446-010-0101-9
- By:
- Publication type:
- Article
7
New combinatorial topology bounds for renaming: the lower bound.
- Published in:
- Distributed Computing, 2010, v. 22, n. 5/6, p. 287, doi. 10.1007/s00446-010-0108-2
- By:
- Publication type:
- Article