Edge Betweenness Centrality on Trees
Publication Date
9-1-2020
Document Type
Conference Proceeding
Publication Title
2020 Second International Conference on Transdisciplinary AI (TransAI)
DOI
10.1109/TransAI49837.2020.00023
First Page
104
Last Page
107
Abstract
Computing the edge betweenness centrality is an important step in a great deal of the analysis tasks of community structures in complex networks. It mostly serves as a measure for the traffic or flow of a particular edge in connecting various parts or communities together. Various algorithms that compute the edge betweenness centrality in general graphs exist but they are expensive. In this paper, we design an algorithm that takes advantage of the structure of tree graphs to compute the edge betweenness centrality more efficiently in such graphs and perform experiments on random graphs.
Keywords
Community detection, Edge betweenness centrality, random graphs, trees
Department
Computer Science
Recommended Citation
Julian Vu and Katerina Potika. "Edge Betweenness Centrality on Trees" 2020 Second International Conference on Transdisciplinary AI (TransAI) (2020): 104-107. https://doi.org/10.1109/TransAI49837.2020.00023
