A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Fast Triangle Core Decomposition for Mining Large Graphs
[chapter]
2014
Lecture Notes in Computer Science
Large triangle cores represent dense subgraphs for which each edge has at least k − 2 triangles (same as cliques). This paper presents a fast algorithm for computing the triangle core decomposition on big graphs. The proposed triangle core algorithm adapts both the computations and representation based on the properties of the graph. In addition, we develop a fast edge-based parallel triangle counting algorithm, which lies at the heart of the triangle core decomposition. The proposed algorithm
doi:10.1007/978-3-319-06608-0_26
fatcat:rd6ljbqtzfalde57ywga4c4loe