SSumM: Sparse Summarization of Massive Graphs

Kyuhan Lee, Hyeonsoo Jo, Jihoon Ko +2

Given a graph G and the desired size k in bits, how can we summarize G within k bits, while minimizing the information loss? Large-scale graphs have become omnipresent, posing cons…