Method for finding the most prominent group of vertices in complex data communication networks

摘要

Searching process for finding the most prominent group of vertices in a graph representing a data communication network, according to the Group Betweenness Centrality (GBC) of the group by searching a decision tree for that group. Each node C in the decision tree maintains one group of vertices (GM(C)) and an ordered list of candidate vertices (CL(C)). Each vertex may be added to GM(C) during the search process. The most prominent group comprises a predetermined number of vertices k that can inspect or modify most of the information flow in the network.