Name
Abstract | ||
|---|---|---|
We present simple deterministic algorithms for subgraph finding and enumeration in the broadcast CONGEST model of distributed computation: -- For any constant $k$, detecting $k$-paths and trees on $k$ nodes can be done in constantly many rounds, and $k$-cycles in $O(n)$ rounds. -- On $d$-degenerate graphs, cliques and $4$-cycles can be enumerated in $O(d + log n)$ rounds, and $5$-cycles in $O(d^2 + log n)$ rounds. In many cases, these bounds are tight up to logarithmic factors. Moreover, we show that the algorithms for $d$-degenerate graphs can be improved to optimal complexity $O(d/log n)$ and $O(d^2/log n)$, respectively, in the supported CONGEST model, which can be seen as an intermediate model between CONGEST and the congested clique. |
Year | Venue | DocType |
|---|---|---|
2017 | OPODIS | Conference |
Volume | Citations | PageRank |
abs/1705.10195 | 3 | 0.38 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janne Korhonen | 1 | 71 | 10.52 |
| Joel Rybicki | 2 | 78 | 9.69 |