On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396)
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 6244227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the time and the bit complexity of distributed randomised anonymous ring colouring |
scientific article; zbMATH DE number 6244227 |
Statements
On the time and the bit complexity of distributed randomised anonymous ring colouring (English)
0 references
10 January 2014
0 references
bit complexity
0 references
colouring
0 references
Mellin transform
0 references
probabilistic analysis
0 references
randomised distributed graph algorithm
0 references
ring graph
0 references
time complexity
0 references
0 references
0.8504307270050049
0 references
0.8396022319793701
0 references
0.8372502326965332
0 references
0.8372489213943481
0 references
0.8164889812469482
0 references
