Distributed Identification of Central Nodes with Less Communication

Applied Network Science

Table 3 Shortest path distances between the exact most central node and approximated most central node using pruning and the YTQ method

D	Y\(_1\)	P\(_1\)	Y\(_2\)	P\(_2\)
2	5	5	14	14
6	14	10	19	5
10	13	1	20	0
14	14	4	19	2
18	8	0	0	0
22	0	0	0	2
26	0	0	0	0

We use two random graphs, one with 70 nodes and diameter of 35, and another with 72 nodes and diameter of 32. One method achieves better approximations than another if the distance of the selected node from the true most central node is smaller. Y\(_i\) and P\(_i\) indicate shortest path distances for the YTQ and pruning methods on the i-th random graph respectively