An efficient generator for clustered dynamic random networks

DOI10.1007/978-3-642-34862-4_16MaRDI QIDQ4916045zbMATH OpenOpenAlexFDO

Authors Robert Görke, Roland Kluge, Andrea Schumm, Christian Staudt, Dorothea Wagner

Publication date 19 April 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://publikationen.bibliothek.kit.edu/1000029825/2286280

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2089226
• Dynamic graph clustering combining modularity and smoothness
• Distributed Community Detection in Dynamic Graphs
• Distributed community detection in dynamic graphs
• Dynamic Graph Clustering Using Minimum-Cut Trees

Cited in

(1)

• Fast generation of random permutations via networks simulation

This page was built for publication: An efficient generator for clustered dynamic random networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916045)