Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6244350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings |
scientific article; zbMATH DE number 6244350 |
Statements
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (English)
0 references
10 January 2014
0 references
0 references
0 references
0.9229038953781128
0 references
0.8825966119766235
0 references
0.879909098148346
0 references
0.8396022319793701
0 references
0.820598304271698
0 references
