Core decomposition and maintenance in weighted graph
Core decomposition and maintenance in weighted graph
复制标题
加权图中的核心分解与维护
DOI:
10.1007/s11280-020-00857-0
复制
发表时间:
2021-01
影响因子:
3.7
通讯作者:
Fu Xiaoming
中科院分区:
文献类型:
--
作者:
Zhou Wei;Huang Hong;Hua Qiang-Sheng;Yu Dongxiao;Jin Hai;Fu Xiaoming
Coreness is an important index to reflect the cohesiveness of a graph. The problems of core computation in static graphs and core update in dynamic graphs, known as the core decomposition and core maintenance problems respectively, have been extensively studied in previous work. However, most of these work focus on unweighted graphs. Considering that graphs are weighted in a lot of realistic applications, it is indispensable to extend the coreness to weighted graphs and devise efficient algorithms for weighted core decomposition and weighted core maintenance. In this work, we present a new definition of weighted coreness for vertices in a weighted graph, by taking into account the weights of vertices, which makes the coreness in unweighted graph be a special case. We propose efficient algorithms for both weighted core decomposition and weighted core maintenance problems. The coreness of vertices can be computed in linear time by the proposed decomposition algorithm, while the proposed core maintenance algorithm can process multiple-edge insertions/deletions simultaneously, which greatly reduces the core update time. Comprehensive experiments on both realistic networks and temporal graphs exhibit our algorithms are efficient and scalable.
登录
查看更多内容
DOI:
10.1109/icdmw.2014.31
发表时间:
2014-12
期刊:
2014 IEEE International Conference on Data Mining Workshop
影响因子:
--
作者:
Chung-Yuan Huang;Yu-Hsiang Fu;Chuen-Tsai Sun
通讯作者:
Chung-Yuan Huang;Yu-Hsiang Fu;Chuen-Tsai Sun
影响因子:
5.6
作者:
Samudrala, R;Moult, J
通讯作者:
Moult, J
影响因子:
3.9
作者:
B. Liu;Feiteng Zhang
通讯作者:
B. Liu;Feiteng Zhang
DOI:
--
发表时间:
2014-06
期刊:
--
影响因子:
--
作者:
J. Leskovec;A. Krevl
通讯作者:
J. Leskovec;A. Krevl
影响因子:
2.4
作者:
Eidsaa, Marius;Almaas, Eivind
通讯作者:
Almaas, Eivind