G-2011-32
Maximizing Edge-Ratio Is NP-Complete
, , and BibTeX reference
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.
Published June 2011 , 12 pages
Research Axis
Research applications
Publication
Jan 2011
Maximizing edge-ratio is NP-complete
, , and
Discrete Applied Mathematics, 159(18), 2276–2280, 2011
BibTeX reference