Sparse matrix factorization heavily relies on combinatory graph algorithms. For example see the section "Bipartite matching for sparse solvers" and "Graph partitioning" (for fill-reducing ordering) in ...

The GraphBLAS C API allows users to implement graph algorithms in the language of linear algebra. It is part of the larger GraphBLAS effort, and there are bindings for the GraphBLAS in many languages ...

"GraphBLAS is an elegantly small number of functions that are feasible to implement in hardware, as we have demonstrated in the Lincoln Laboratory Graph Processor," says Kepner.

The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix-based graph algorithms to the broadest possible audience. Mathematically, the GraphBLAS defines a core set of ...

GraphBLAS, a Linear Algebra Abstraction Layer for Graph TechnologyFAIRFAX, VA / ACCESSWIRE / October 29, 2020 / Visium Technologies, Inc.

Diffusion processes, characterised through operators such as the graph Laplacian, foster the development of diffusion maps which yield robust, multi-scale representations.