@inproceedings{1fa94e1c8b854493bf3c981ad2ccc6a6,
title = "Fast truss decomposition in memory",
abstract = "The k-truss is a type of cohesive subgraphs proposed for the analysis of massive network. Existing in-memory algorithms for computing k-truss are inefficient for searching and parallel. We propose a novel traversal algorithm for truss decomposition: it effectively reduces computation complexity, we fully exploit the parallelism thanks to the optimization, and overlap IO and computation for a better performance. Our experiments on real datasets verify that it is 2x–5x faster than the exiting fastest in-memory algorithm.",
keywords = "Cohesive subgraphs, Triangle counting, Truss decomposition",
author = "Yuxuan Xing and Nong Xiao and Yutong Lu and Ronghua Li and Songping Yu and Siqi Gao",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 10th International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage, SpaCCS 2017 ; Conference date: 12-12-2017 Through 15-12-2017",
year = "2017",
doi = "10.1007/978-3-319-72395-2_64",
language = "English",
isbn = "9783319723945",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "719--729",
editor = "Guojun Wang and Zheng Yan and Choo, {Kim-Kwang Raymond} and Mohammed Atiquzzaman",
booktitle = "Security, Privacy, and Anonymity in Computation, Communication, and Storage - SpaCCS 2017 International Workshops, Proceedings",
address = "Germany",
}