Problemadvanced
Distributed maximal independent set
Also called distributed MIS, maximal independent set in distributed networks.
Find an independent set that is maximal, computed in rounds where each node sees only its neighbourhood.
Find an independent set that is maximal, computed in rounds where each node sees only its neighbourhood.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag CESMCY Edit this page History Report an error