Table 1 Comparison of five centrality algorithms using different performance criteria (i.e. functional, computational efficiency, and accuracy). The bold values represent the best performer for specific performance criteria.
From: Decentralized dynamic understanding of hidden relations in complex networks
Algorithm | Functional Performance | Computational Efficiency Performance | Accuracy Performance | |
|---|---|---|---|---|
Architecture | Time complexity | |||
GOT with SC2 | Nodes and Links | Fully Distributed | O(log2|V|) < O(GOT) < O(log3|V|) | 83.4% |
CFBC31 | Nodes or Links | Centralized | O(I(|V| − 1) + |V||E|log|V|) | 8.3% |
BC30 | Nodes or Links | Centralized | O(|V||E|) | 8.3% |
SOC32 | Nodes | Partially Distributed | O(|V|2) < O(SOC) < O(|V|3) | 0% |
DACCER21 | Nodes | Fully Distributed | n/a | 0% |
