Fig. 5
From: Distributed Identification of Central Nodes with Less Communication
Differences of shortest path distances between approximated central nodes obtained using the YTQ and our pruning methods with respect to the exact most central node on two random graphs: (5a): the first (diameter of 26, 125 nodes and 180 edges) and (5b): second (diameter of 36, 289 nodes and 597 edges)random graphs. Positive values indicate that our method is better than the YTQ method