Symmetry breaking in congested models: lower and upper bounds
A fundamental issue in many distributed computing problems is the need for nodes to distinguish themselves from their neighbors in a process referred to as symmetry breaking. Many well-known problems such as Maximal Independent Set (MIS), t-Ruling Set, Maximal Matching, and (\Delta+1)-Coloring, belo...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
University of Iowa
2019
|
| Subjects: | |
| Online Access: | https://ir.uiowa.edu/etd/7019 https://ir.uiowa.edu/cgi/viewcontent.cgi?article=8520&context=etd |