Shared-Memory Parallel Triangle Counting
I implemented the Degree-Ordered Directed Graph (DODG) algorithm for triangle counting on undirected graphs. Prior work on this problem was based on adjacency matrix multiplication, which is slow and memory...
Parallel detection of SCC
A directed graph is strongly connected if there is a path between all pairs of vertices. A strongly connected component (SCC) of a directed graph is a maximal strongly connected...
Experiments with parallel connected components
A connected component of an undirected graph is a maximal set of nodes such that each pair of nodes is connected by a path. Connected components can be identified serially...
Triangle Counting
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis that require the count of triangles are the clustering coefficients & the transitivity...
BFS using GraphBLAS
Here I present a simple BFS code written in Julia using GraphBLAS. This algorithm is taken straight from the API documentation & may not be the fastest method but it’s...
An introduction to GraphBLAS
The GraphBLAS project is an open effort to define standard building blocks for graph algorithms in the language of linear algebra. I’ll try to give a brief overview of the...