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 this page instead for the normal view: Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings |
scientific article; zbMATH DE number 6244350
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 references
