Table 1 Table indicating pruned nodes, identified at each node after each iteration using the graph in Fig. 1
From: Distributed Identification of Central Nodes with Less Communication
Node sets | \(\textrm{ecc}_i\) | \(t=1\) | \(t=2\) | \(t=3\) | \(t=4\) |
|---|---|---|---|---|---|
\({\mathcal {F}}_{1}^{(t)}\) | 4 | \(v_1\) | \(\perp\) | \(\perp\) | \(\perp\) |
\({\mathcal {F}}_{2}^{(t)}\) | 4 | \(v_1\) | \(v_4\) | \(v_2\) | \(\perp\) |
\({\mathcal {F}}_{3}^{(t)}\) | 3 | \(v_1\) | \(\emptyset\) | \(v_2, v_7\) | \(\top\) |
\({\mathcal {F}}_{4}^{(t)}\) | 5 | \(v_5, v_6\) | \(v_4\) | \(\perp\) | \(\perp\) |
\({\mathcal {F}}_{5}^{(t)}\) | 6 | \(v_5\) | \(\perp\) | \(\perp\) | \(\perp\) |
\({\mathcal {F}}_{6}^{(t)}\) | 6 | \(v_6\) | \(\perp\) | \(\perp\) | \(\perp\) |
\({\mathcal {F}}_{7}^{(t)}\) | 4 | \(\emptyset\) | \(v_8\) | \(v_7\) | \(\perp\) |
\({\mathcal {F}}_{8}^{(t)}\) | 5 | \(v_9, v_{10}\) | \(v_8\) | \(\perp\) | \(\perp\) |
\({\mathcal {F}}_{9}^{(t)}\) | 6 | \(v_9\) | \(\perp\) | \(\perp\) | \(\perp\) |
\({\mathcal {F}}_{10}^{(t)}\) | 6 | \(v_{10}\) | \(\perp\) | \(\perp\) | \(\perp\) |