Parallel triangle counting and k-truss identification using graph-centric methods
Authors:
- 1 September 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Abstract
We describe CPU and GPU implementations of parallel triangle-counting and k-truss identification in the Galois and IrGL systems. Both systems are based on a graph-centric abstraction called the operator formulation of algorithms. Depending on the input graph, our implementations are two to three orders of magnitude faster than the reference implementations provided by the IEEE HPEC static graph challenge.Keywords
This publication has 9 references indexed in Scilit:
- Static graph challenge: Subgraph isomorphism2017
- Graphing trillions of trianglesInformation Visualization, 2016
- Counting Triangles in Large Graphs on GPU2016
- A task-based linear algebra Building Blocks approach for scalable graph analytics2015
- Efficient cohesive subgraphs detection in parallel2014
- A lightweight infrastructure for graph analytics2013
- The tao of parallelism in algorithms2011
- Ordered vs. unordered2011
- Lonestar: A suite of parallel irregular programs2009