Graph algorithms via SuiteSparse:GraphBLAS: triangle counting and K-truss Conference Paper

abstract

• 2018 IEEE. SuiteSparse: GraphBLAS is a full implementation of the GraphBLAS standard, which defines a set of sparse matrix operations on an extended algebra of semirings using an almost unlimited variety of operators and types. When applied to sparse adjacency matrices, these algebraic operations are equivalent to computations on graphs. GraphBLAS provides a powerful and expressive framework for creating graph algorithms based on the elegant mathematics of sparse matrix operations on a semiring. To illustrate GraphBLAS, two graph algorithms are constructed in GraphBLAS and compared with efficient implementations without GraphBLAS: triangle counting and constructing the k-truss of a graph.

name of conference

• 2018 IEEE High Performance extreme Computing Conference (HPEC)

authors

• Davis, Timothy

published proceedings

• 2018 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC)

author list (cited authors)

• Davis, T. A.

citation count

• 32

complete list of authors

• Davis, Timothy A

publication date

• January 2018

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• n2377-6943ISSN  Journal

keywords

• Graph Algorithms
• Sparse Matrix Computations

Digital Object Identifier (DOI)

• 10.1109/hpec.2018.8547538

International Standard Book Number (ISBN) 13

• 9781538659892

start page

• 1

end page

• 6

volume

• 00

URL

• http://dx.doi.org/10.1109/hpec.2018.8547538