The following pages link to MIS on trees (Q2943380):
Displaying 4 items.
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Distributed MIS in O(log log n) Awake Complexity (Q6202235) (← links)
