Note: Maximizing edge-ratio is NP-complete

Authors:
Steven D. Noble;Pierre Hansen;Nenad Mladenović
Affiliations:
Department of Mathematical Sciences, Brunel University, Kingston Lane, Uxbridge, UB8 3PH, UK;GERAD, HEC Montréal, Montréal (Québec) Canada and LIX, Ecole Polytechnique Palaiseau, France;Department of Mathematical Sciences, Brunel University, Kingston Lane, Uxbridge, UB8 3PH, UK
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 2
Cited 0

On clusterings: Good, bad and spectral

Journal of the ACM (JACM)
On Modularity Clustering

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.04

Visualization

Abstract

Given a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divided by their number of cut edges. We prove that maximizing edge-ratio is NP-complete.