Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2967878.2967909 | ICCCNT |
Field | DocType | Citations |
Discrete mathematics,Strength of a graph,Loop (graph theory),Directed graph,Algorithm,Null graph,Random geometric graph,Butterfly graph,Voltage graph,Mathematics,Moral graph | Conference | 0 |
PageRank | References | Authors |
0.34 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kento Hamda | 1 | 0 | 0.34 |
| Genya Ishigaki | 2 | 46 | 7.69 |
| Yoichi Sakai | 3 | 0 | 0.34 |
| Norihiko Shinomiya | 4 | 50 | 19.15 |