Datasets for Computing k-Bisimulations for Large Graphs
Jannik Rau · Zenodo (CERN European Organization for Nuclear Research) · 2024
Summarizing graphs w.r.t. structural features is important to reduce the graph's size and make tasks like indexing, querying, and visualization feasible. These datasets help to compare and analyze algorithms for graph summarization.