4 citations · 4 across the 1 of their papers we have counts for
1 paper
Keisuke Sato, Yoichi Izunaga
For clustering of an undirected graph, this paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the…