| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418531 | Discrete Applied Mathematics | 2011 | 5 Pages |
Abstract
Given a graph GG 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.
► We consider edge-ratio, a relatively new measure of clustering quality. ► We show that maximizing edge-ratio is NP-complete. ► Our reduction is from MAX CUT and establishes hardness of related problems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Steven D. Noble, Pierre Hansen, Nenad Mladenović,