Graph Compression for Adjacency-Matrix Multiplication.
Alexandre P. FranciscoTravis GagieDominik KöpplSusana LadraGonzalo NavarroPublished in: SN Comput. Sci. (2022)
Keyphrases
- matrix multiplication
- graph representation
- strongly connected
- image compression
- random walk
- directed graph
- message passing
- graph structure
- distributed memory
- structured data
- compression algorithm
- three dimensional
- graph theory
- data compression
- undirected graph
- matrix factorization
- directed acyclic graph
- weighted graph
- graphical models
- software engineering
- objective function