Research Article
Approximating Betweenness Centrality to Identify Key Nodes in a Weighted Urban Complex Transportation Network
(1) For 1: N | (2) Input | (3) Input weighted network adjacency matrix | (4) Calculate | (5) Calculate | (6) Integrate (4), (5) | (7) Select Top-k |
|