Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W20 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6244350 / rank | |||
Normal rank | |||
Revision as of 14:15, 29 June 2023
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
