[Main website]


GraphBLAS (ˈɡræfˌblɑːz (listen)) is an API specification that defines standard building blocks for graph algorithms in the language of linear algebra.[1][2] GraphBLAS is built upon the notion that a sparse matrix can be used to represent graphs as either an adjacency matrix or an incidence matrix. The GraphBLAS specification describes how graph operations (e.g. traversing and transforming graphs) can be efficiently implemented via linear algebraic methods (e.g. matrix multiplication) over different semirings.


There can be speedup of 600x on CPU and also more on GPU.

MAYBE probably many tech related to Han counting method and similar, are subsumed by this technique