Computing $k$-Bisimulations for Large Graphs: A Comparison and Efficiency Analysis

Jannik Rau, David Richerby, Ansgar Scherp

Summarizing graphs w.r.t. structural features is important to reduce the graph's size and make tasks like indexing, querying, and visualization feasible. Our generic parallel BRS a…