Pages that link to "Item:Q710742"
From MaRDI portal
The following pages link to About randomised distributed graph colouring and graph partition algorithms (Q710742):
Displaying 5 items.
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396) (← links)
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
