A GraphBLAS Implementation of Triangle Centrality

Authors

Fuhuan Li, Ying Wu College of Computing
David A. Bader, Ying Wu College of Computing

Document Type

Conference Proceeding

Publication Date

1-1-2021

Abstract

Identifying key members in large social network graphs is an important graph analytic. Recently, a new centrality measure called triangle centrality finds members based on the triangle support of vertices in graph. In this paper, we describe our rapid implementation of triangle centrality using Graph-BLAS, an API specification for describing graph algorithms in the language of linear algebra. We use triangle centrality's algebraic algorithm and easily implement it using the SuiteSparse GraphBLAS library. A set of experiments on large, sparse graph datasets is conducted to verify the implementation.

Identifier

85123491270 (Scopus)

ISBN

[9781665423694]

Publication Title

2021 IEEE High Performance Extreme Computing Conference Hpec 2021

External Full Text Location

https://doi.org/10.1109/HPEC49654.2021.9622806

Grant

CCF-2109988

Fund Ref

National Science Foundation

Recommended Citation

Li, Fuhuan and Bader, David A., "A GraphBLAS Implementation of Triangle Centrality" (2021). Faculty Publications. 4472.
https://digitalcommons.njit.edu/fac_pubs/4472