Standards for Graph Algorithm Primitives
Mathematical Software
2015-05-26 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
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.
Keywords
Cite
@article{arxiv.1408.0393,
title = {Standards for Graph Algorithm Primitives},
author = {Tim Mattson and David Bader and Jon Berry and Aydin Buluc and Jack Dongarra and Christos Faloutsos and John Feo and John Gilbert and Joseph Gonzalez and Bruce Hendrickson and Jeremy Kepner and Charles Leiserson and Andrew Lumsdaine and David Padua and Stephen Poole and Steve Reinhardt and Mike Stonebraker and Steve Wallach and Andrew Yoo},
journal= {arXiv preprint arXiv:1408.0393},
year = {2015}
}
Comments
2 pages, IEEE HPEC 2013