Title of article
Maximizing edge-ratio is NP-complete
Author/Authors
Steven D. Noble، نويسنده , , Pierre Hansen، نويسنده , , Nenad Mladenovic، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
5
From page
2276
To page
2280
Abstract
Given a graph image 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.
Keywords
Graph clustering , Community detection , Edge-ratio , NP-complete
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887767
Link To Document