Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings.
Allyx FontaineYves MétivierJohn Michael RobsonAkka ZemmariPublished in: Inf. Comput. (2013)
Keyphrases
- worst case
- space complexity
- computational complexity
- distributed systems
- computational cost
- complexity analysis
- optimal solution
- memory requirements
- high computational complexity
- cooperative
- peer to peer
- theoretical analysis
- benchmark datasets
- orders of magnitude
- computationally efficient
- search procedure
- shape matching
- genetic algorithm
- multi agent