Name
Abstract | ||
|---|---|---|
Triangle listing, or identifying all the triangles in an undirected graph, is a very important graph problem that serves as a building block of many other graph algorithms. The compute-intensive nature of the problem, however, necessitates an efficient method to solve this problem, especially for large real-world graphs. In this paper we propose a fast and precise in-memory solution for the triangle listing problem. Our solution includes fast common neighborhoods finding methods that consider power law degree distribution of real-word graphs. We prove how theoretic lower bound can be achieved by sorting the nodes in the graph by their degree and applying pruning. We explain how our techniques can be applied automatically by an optimizing DSL compiler. Our experiments show that hundreds of billions of triangles in a five billion edge graph can be enumerated in about a minute with a single server-class machine. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2659480.2659494 | SNAKDD |
Field | DocType | Citations |
Discrete mathematics,Block graph,Comparability graph,Outerplanar graph,Line graph,Graph property,Theoretical computer science,Pathwidth,Butterfly graph,Graph (abstract data type),Mathematics | Conference | 10 |
PageRank | References | Authors |
0.49 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Sevenich | 1 | 14 | 1.25 |
| Sungpack Hong | 2 | 864 | 33.20 |
| Adam Welc | 3 | 384 | 24.01 |
| Hassan Chafi | 4 | 1118 | 61.11 |