Three Algorithms for Parallel Graph Summarization.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	Three Algorithms for Parallel Graph Summarization.
Συγγραφείς:	Blume, Till¹ (AUTHOR), Rau, Jannik² (AUTHOR), Richerby, David³ (AUTHOR), Scherp, Ansgar² (AUTHOR) ansgar.scherp@uni‐ulm.de
Πηγή:	Expert Systems. Jan2026, Vol. 43 Issue 1, p1-23. 23p.
Θεματικοί όροι:	Batch processing, Algorithms, Parallel algorithms, Graph algorithms, Graph theory, Computational complexity
Περίληψη:	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 algorithm for static graphs, an incremental algorithm for evolving graphs, and a hash‐based algorithm that scales to large graphs and large schema structures, that is, using paths of length up to k$$ k $$ to define vertex equivalence. Experimenting with benchmark and real‐world datasets, we observe that the incremental algorithm almost always runs faster than batch computation, even when 50% of the graph changes, and even when using fewer cores; however, it only uses 8% more memory (±1%$$ \pm 1\% $$). Furthermore, we show that the hash‐based algorithm can compute 10‐hop equivalent subgraphs on graphs with over 10 M edges within seconds, on graphs of 100 + M edges within a few minutes, and on graphs of 1 + B edges in less than an hour. We analyse the complexity of our algorithms in detail and prove that the incremental algorithm is correct. Overall, we show with these three algorithms that our parallel approach for graph summarisation is versatile and opens the path for various applications that require summaries of large‐scale graphs. [ABSTRACT FROM AUTHOR]
	Copyright of Expert Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Βάση Δεδομένων:	Business Source Index

καταχωρήστε σχόλιο πρώτοι!