BETWEENNESS CENTRALITY UPDATING METHOD OF GRAPH

摘要

The present invention relates to a betweenness centrality updating method of a graph. The method comprises (a) a step of obtaining a minimum cycle (hereinafter called the MUC) from an updated graph; (b) a step of extracting the MUC including a peak (hereinafter called the updated peak) transmitted to an updated edge (hereinafter called the MUCU) and calculating betweenness centrality (hereinafter called the local betweenness centrality) due to the shortest paths (hereinafter called the inner path) within the MUCU; (c) a step of obtaining betweenness centrality (hereinafter called the outer path increment) due to the shortest paths (hereinafter called the outer path) of the graph which is not included within the MUCU; and (d) a step of calculating betweenness centrality (hereinafter called the global betweenness centrality) of the graph by adding the outer path increament to the local betweenness centrality.;COPYRIGHT KIPO 2014