Linear Algebraic Formulation of Edge-centric K-truss Algorithms with Adjacency Matrices
Authors:
- 1 September 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Abstract
Edge-centric algorithms using the linear algebraic approach typically require the use of both the incidence and adjacency matrices. Due to the two different data formats, the information contained in the graph is replicated, thereby incurring both time and space for the replication. Using K-truss as an example, we demonstrate that an edge-centric K-truss algorithm, the Eager K-truss algorithm, can be identified from a linear algebraic formulation using only the adjacency matrix. In addition, we demonstrate that our implementation of the linear algebraic edge-centric K-truss algorithm out-performs a Galois' K-truss implementation by an average (over 53 graphs) of more than 13 times, and up to 71 times.Keywords
This publication has 5 references indexed in Scilit:
- Parallel triangle counting and k-truss identification using graph-centric methods2017
- Thinking Like a VertexACM Computing Surveys, 2015
- Truss decomposition in massive networksProceedings of the VLDB Endowment, 2012
- The tao of parallelism in algorithms2011
- Pregel2010