Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ic.2013.10.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IC.2013.10.005 / rank | |||
Normal rank | |||
Revision as of 00:50, 9 December 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
