Brief announcement: Using read-\(k\) inequalities to analyze a distributed MIS algorithm (Q5361973)
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: Brief announcement: Using read-k inequalities to analyze a distributed MIS algorithm |
scientific article; zbMATH DE number 6784212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Brief announcement: Using read-\(k\) inequalities to analyze a distributed MIS algorithm |
scientific article; zbMATH DE number 6784212 |
Statements
Brief Announcement (English)
0 references
29 September 2017
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
0.9887699484825134
0 references
0.8390737175941467
0 references
0.8170525431632996
0 references
0.8164565563201904
0 references
