Three Algorithms for Parallel Graph Summarization

Most graph summarization algorithms are tailored to a specific graph summary model and were designed for one‐time computations only, that is, batch‐based computations. We developed a universal approach for parallel graph summarization and three algorithms to compute graph summaries—a batch‐based alg...

Full description

Saved in:
Bibliographic Details
Published in:Expert systems 2026-01, Vol.43 (1), p.n/a
Main Authors: Blume, Till, Rau, Jannik, Richerby, David, Scherp, Ansgar
Format: Article
Language:English
Subjects:
Algorithms
Equivalence
graph summarisation
Graph theory
Graphs
k‐bisimulation
parallel algorithms
Summaries
temporal graphs
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!