Using Read-k Inequalities to Analyze a Distributed MIS Algorithm (Q3174932)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using Read-k Inequalities to Analyze a Distributed MIS Algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using Read-k Inequalities to Analyze a Distributed MIS Algorithm |
scientific article |
Statements
18 July 2018
0 references
bounded arboricity graphs
0 references
CONGEST model
0 references
Luby's algorithm
0 references
maximal independent set
0 references
read-\(k\) inequality
0 references
Using Read-k Inequalities to Analyze a Distributed MIS Algorithm (English)
0 references
