Truss decomposition in massive networks
Publication in refereed journal

替代計量分析
.

其它資訊
摘要The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most co-hesive subgraphs is NP-hard, there exists a polynomial time al-gorithm for computing k-truss. Compared with k-core which is also efficient to compute, k-truss represents the " core" of a k-core that keeps the key information of, while filtering out less impor-tant information from, the k-core. However, existing algorithms for computing k-truss are inefficient for handling today's massive networks. We first improve the existing in-memory algorithm for computing k-truss in networks of moderate size. Then, we propose two I/O-efficient algorithms to handle massive networks that can-not fit in main memory. Our experiments on real datasets verify the efficiency of our algorithms and the value of k-truss. © 2012 VLDB Endowment.
著者Wang J., Cheng J.
期刊名稱Proceedings of the VLDB Endowment
詳細描述To ORKTS: Other keyword:
4. triangle listing
出版年份2012
月份5
日期1
卷號5
期次9
頁次812 - 823
國際標準期刊號2150-8097
語言英式英語

上次更新時間 2020-19-10 於 01:20