Graph Clustering and Minimum Cut Trees

390 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Internet of Underwater Things and Big Marine Data Analytics—A Comprehensive Survey (2020, neutral): “[214] as well as Wang et al.”
A survey of frequent subgraph mining algorithms (2012, neutral): “, 2005) Graph clustering (Flake et al., 2004; Newman, 2004; Huang & Lai, 2006) Graph indexing (Shasha et al.”
Device-to-Device Communication in LTE-Advanced Networks: A Survey (2015, methodology): “The network connectivity is calculated with the minimum cut tree method [75], in which the network is partitioned into two parts by removing the links of minimum cut costs.”
Statistical properties of community structure in large social and information networks (2008, background): “Flake, Tarjan, and Tsioutsiouliklis [68] introduce a similar bicriterion that is based on network flow ideas, and Flake et al.”
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters (2008, background): “Flake, Tarjan, and Tsioutsiouliklis [69] introduce a similar bicriterion that is based on network flow ideas, and Flake et al. [67, 68] defined a community as a set of nodes that has more intra-edges than inter-edges.”