# Standards for Graph Algorithm Primitives

arXiv: https://arxiv.org/abs/1408.0393 · HTML: https://mlsanity.com/paper/1408.0393/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Aug 2014.

## Built on by (most cited first, 3 of 3)

- [Graph Computing for Financial Crime and Fraud Detection: Trends, Challenges and Outlook](https://mlsanity.com/paper/2103.03227/) (2021)
- [GPU Semiring Primitives for Sparse Neighborhood Methods](https://mlsanity.com/paper/2104.06357/) (2021)
- [Natural Language Querying System Through Entity Enrichment](https://mlsanity.com/paper/2410.15753/) (2024)

## Abstract (arXiv)

It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building blocks. This paper is a position paper defining the problem and announcing our intention to launch an open effort to define this standard.