Core Decomposition in Large Temporal Graphs
Refereed conference paper presented and published in conference proceedings

Full Text

Times Cited
Web of Science10WOS source URL (as at 30/05/2020) Click here for the latest count

Other information
AbstractCore decomposition has been applied widely in the visualization and analysis of massive networks. However, existing studies of core decomposition were only limited to non-temporal graphs, while many real-world graphs can be naturally modeled as temporal graphs (e.g., the interaction between users at different time in online social networks, the phone call or messaging records between friends over time, etc.). In this paper, we define the problem of core decomposition in a temporal graph, propose efficient distributed algorithms to compute the cores in massive temporal graphs, and discuss how the technique can be used in temporal graph analysis.
All Author(s) ListWu HH, Cheng J, Lu Y, Ke YP, Huang YZ, Yan D, Wu HJ
Name of ConferenceIEEE International Conference on Big Data
Start Date of Conference29/10/2015
End Date of Conference01/11/2015
Place of ConferenceSanta Clara
Country/Region of ConferenceUnited States of America
Pages649 - 658
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science; Computer Science, Information Systems; Engineering; Engineering, Electrical & Electronic

Last updated on 2020-31-05 at 03:25