Scalable Dynamic Graph Summarization

Large-scale dynamic interaction graphs can be challenging to process and store, due to their size and the continuous change of communication patterns between nodes. In this work, we address the problem of summarizing large-scale dynamic graphs, while maintaining the evolution of their structure and...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on knowledge and data engineering Jg. 32; H. 2; S. 360 - 373
Hauptverfasser:	Tsalouchidou, Ioanna, Bonchi, Francesco, Morales, Gianmarco De Francisci, Baeza-Yates, Ricardo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.02.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Clustering Clustering algorithms dynamic graphs Evolution Graph summarization Graphs Heuristic algorithms Microsoft Windows Nodes Scalability Silicon Tensile stress Windows (intervals)
ISSN:	1041-4347, 1558-2191
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!