How we implemented scalable graph summarization

How we implemented scalable graph summarization

tl;dr k-bisimulation can be used to create a condensed version of a graph. This condensed version is a graph summary, keeping specific properties of the original k-bisimulation partitions the nodes of the graph in equivalence classes which we call blocks We create the...