In this paper, we address the question of how to automatically map computational kernels to
highly efficient code for a wide range of computing platforms and establish the correctness of …

Triangle counting is a graph algorithm that calculates the number of triangles involving each
vertex in a graph. Briefly, a triangle encompasses three vertices from a graph, where every …

Triangle counting is a building block for a wide range of graph applications. Traditional
wisdom suggests that i) hashing is not suitable for triangle counting, ii) edge-centric triangle …

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 …

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 …

Listing and counting triangles in graphs is a key algorithmic kernel for network analyses
including community detection, clustering coefficients, k-trusses, and triangle centrality. We …

There is a recent push by a segment of the graph community to implement graph algorithms
in the language of linear algebra. However, graph algorithms that depend on depth-first …

The notion of “centrality” within graph analytics has led to the creation of well-known metrics
such as Google's Page Rank [1], which is an extension of eigenvector centrality [2]. Triangle …

We provide a first look at GBTLX, a code generator that translates graph processing
programs written using the GraphBLAS Template Library (GBTL) into high-performance C …