G-2011-32
Maximizing Edge-Ratio Is NP-Complete
SD Noble, Pierre Hansen et Nenad Mladenović
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.
Paru en juin 2011 , 12 pages