Browsing Computation by Subject "Local search"
Now showing items 1-1 of 1
-
Efficient modularity density heuristics in graph clustering and their applications
(2017) [Thesis]Modularity Density Maximization is a graph clustering problem which avoids the resolution limit degeneracy of the Modularity Maximization problem. This thesis aims at solving larger instances than current Modularity Density ...