Graph algorithms via SuiteSparse:GraphBLAS: triangle counting and K-truss
Conference Paper
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
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)