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 considerable computational
challenges. Analyzing such large graphs can be fast and easy if they are
compressed sufficiently to fit in main memory or even cache. Graph
summarization, wh