no code implementations • 3 Jun 2016 • Junming Shao, Qinli Yang, Jinhu Liu, Stefan Kramer
We demonstrate that our method has several attractive benefits: (a) Dcut provides an intuitive criterion to evaluate the goodness of a graph clustering in a more natural and precise way; (b) Built upon the density-connected tree, Dcut allows identifying the meaningful graph clusters of densely connected vertices efficiently; (c) The density-connected tree provides a connectivity map of vertices in a graph from a local density perspective.
Social and Information Networks Physics and Society
