Efficient graph computing on the congested clique
In this report, we initiate study on understanding a theoretical model for distributed computing called Congested Clique. This report presents constant-time and near-constant-time distributed algorithms for a variety of problems in the Congested Clique model. We start by showing how to compute a 3-r...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
University of Iowa
2016
|
| Subjects: | |
| Online Access: | https://ir.uiowa.edu/etd/2271 https://ir.uiowa.edu/cgi/viewcontent.cgi?article=6743&context=etd |