Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647): Difference between revisions
From MaRDI portal
Revision as of 04:53, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings |
scientific article |
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