Multicore triangle computations without tuning
Citations
816 citations
124 citations
124 citations
Cites methods from "Multicore triangle computations wit..."
...Breakdown of time spent by (a) Triangle-basic and (b) Triangle-masked-bloom algorithms for different input graphs on 512 cores of Edison. such as PATRIC [20], which uses MPI, and the multicore implementation of Shun and Tangwongsan [21]....
[...]
...such as PATRIC [20], which uses MPI, and the multicore implementation of Shun and Tangwongsan [21]....
[...]
100 citations
Cites methods from "Multicore triangle computations wit..."
...for TC on our larger graphs as the single-threaded times took too long due to the algorithm performing O(m3/2)work. There are a number of experimental papers that consider multicore triangle counting [1, 54, 72, 77, 112, 119]. We implement the algorithm from [119], and adapted it to work on compressed graphs. We note that in our experiments we intersect directed adjacency lists sequentially, as there was sufficient parall...
[...]
99 citations
Cites background or methods from "Multicore triangle computations wit..."
...’s multicore CPU implementation [27], and Shun and Tangwongsan’s multicore CPU implementation [72]....
[...]
...-GPU”), Shun and Tangwongsan’s 40-core CPU implementation [72] (“Shun and Tangwongsan-T40”), and Green et al....
[...]
References
39,297 citations
"Multicore triangle computations wit..." refers background in this paper
...The local clustering coefficient [60] for a vertex v is defined to be the number of triangles incident on v divided by d(v)(d(v)−1)/2 (the number of potential triangles incident on v)....
[...]
17,647 citations
Additional excerpts
...…on directed graphs • Numerous applications… • Social network analysis, Web structure, spam detection, outlier detection, dense subgraph mining, 3-way database joins, etc. 2 Triangle Computations Alice Bob Carol David Eve Fred Greg Hannah ✔ ✔ ✔ Count = 3 Need fast triangle computation…...
[...]
6,108 citations
1,710 citations
"Multicore triangle computations wit..." refers methods in this paper
...• Sequential algorithms for exact counting/listing • Naïve algorithm of trying all triplets O(V3) work • Node-iterator algorithm [Schank] O(VE) work • Edge-iterator algorithm [Itai-Rodeh] O(VE) work • Tree-lister [Itai-Rodeh], forward/compact-forward [Schank-Wagner, Lapaty] O(E1....
[...]
1,202 citations