Structural Summarization of Semantic Graphs Using Quotients

• Published in: Transactions on Graph Data and Knowledge Vol. 1; no. 1; pp. 12:1 - 12:25
• Main Authors: Scherp, Ansgar, Richerby, David, Blume, Till, Cochez, Michael, Rau, Jannik
• Format: Journal Article
• Language: English
• Published: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik 01.12.2023
• Subjects: graph summarization; quotients; stratified bisimulation
• ISSN: 2942-7517
• DOI: 10.4230/TGDK.1.1.12

Graph summarization is the process of computing a compact version of an input graph while preserving chosen features of its structure. We consider semantic graphs where the features include edge labels and label sets associated with a vertex. Graph summaries are typically much smaller than the original graph. Applications that depend on the preserved features can perform their tasks on the summary, but much faster or with less memory overhead, while producing the same outcome as if they were applied on the original graph. In this survey, we focus on structural summaries based on quotients that organize vertices in equivalence classes of shared features. Structural summaries are particularly popular for semantic graphs and have the advantage of defining a precise graph-based output. We consider approaches and algorithms for both static and temporal graphs. A common example of quotient-based structural summaries is bisimulation, and we discuss this in detail. While there exist other surveys on graph summarization, to the best of our knowledge, we are the first to bring in a focused discussion on quotients, bisimulation, and their relation. Furthermore, structural summarization naturally connects well with formal logic due to the discrete structures considered. We complete the survey with a brief description of approaches beyond structural summaries.