175 citations · 254 across the 10 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
math.DS2006★ 12 cited
Probabilistic Inductive Classes of Graphs
Nataša Kejžar, Zoran Nikoloski, Vladimir Batagelj
Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Her…
physics.data-an2006★ 175 cited
Maximizing Modularity is hard
U. Brandes, D. Delling, M. Gaertler +4
Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these…