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...