Biblio
Filters: Author is Sakai, Yoichi [Clear All Filters]
.
2016. Significance Analysis for Edges in a Graph by Means of Leveling Variables on Nodes. Proceedings of the 7th International Conference on Computing Communication and Networking Technologies. :27:1–27:5.
This paper proposes a novel measure for edge significance considering quantity propagation in a graph. Our method utilizes a pseudo propagation process brought by solving a problem of a load balancing on nodes. Edge significance is defined as a difference of propagation in a graph with an edge to without it. The simulation compares our proposed method with the traditional betweenness centrality in order to obtain differences of our measure to a type of centrality, which considers propagation process in a graph.