An optimal bit complexity randomized distributed MIS algorithm
Copyright policy )An optimal bit complexity randomized distributed MIS algorithm
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Bordeaux France
- University of Bordeaux France
- French National Centre for Scientific Research France
Distributed graph algorithm, Randomized algorithms, maximal independent set, Distributed systems, randomized algorithm, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], bit complexity, Graph theory (including graph drawing) in computer science, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Distributed algorithms
Distributed graph algorithm, Randomized algorithms, maximal independent set, Distributed systems, randomized algorithm, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], bit complexity, Graph theory (including graph drawing) in computer science, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Distributed algorithms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).33 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!