Triangle Counting Performance

  title={ Triangle Counting Performance},
  author={S. Samsi and J. Kepner and V. Gadepally and M. Hurley and Michael Jones and E. Kao and S. Mohindra and A. Reuther and S. Smith and William S. Song and D. Staheli and P. Monticciolo},
  journal={2020 IEEE High Performance Extreme Computing Conference (HPEC)},
The rise of graph analytic systems has created a need for new ways to measure and compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph Challenge has been developed to provide a well-defined community venue for stimulating research and highlighting innovations in graph analysis software, hardware, algorithms, and systems. provides a wide range of pre-parsed graph data sets, graph generators, mathematically defined graph algorithms, example serial… Expand

Figures and Tables from this paper

Leveraging Linear Algebra to Count and Enumerate Simple Subgraphs
Towards an Objective Metric for the Performance of Exact Triangle Count


SHOWING 1-10 OF 128 REFERENCES Raising the Bar on Graph Analytic Performance
Graphing trillions of triangles
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices
Static graph challenge: Subgraph isomorphism
Triangle counting for scale-free graphs at scale in distributed memory
  • R. Pearce
  • Computer Science
  • 2017 IEEE High Performance Extreme Computing Conference (HPEC)
  • 2017
Mathematical foundations of the GraphBLAS
Fast Triangle Counting Using Cilk
Fast linear algebra-based triangle counting with KokkosKernels
Scalable Triangle Counting on Distributed-Memory Systems