Dynamic graph clustering combining modularity and smoothness

DOI10.1145/2444016.2444021zbMath1322.68179OpenAlexW2007154613MaRDI QIDQ5178738

Andrea Schumm, Dorothea Wagner, Robert Görke, Pascal Maillard, Christian Staudt

Publication date: 16 March 2015

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000022451/1978045

zbMATH Keywords

modularityexperimental evaluationtemporal smoothnessdynamic graph clustering

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Local community detection in dynamic graphs using personalized centrality

This page was built for publication: Dynamic graph clustering combining modularity and smoothness