In this paper, we study the problem Min-Max 2-Cluster Editing which asks for a modification of a given graph into two maximal cliques by inserting or deleting edges such that the maximum number k of the editing edges incident to any vertex is minimized. We show the NP-hardness of the problem and present a polynomial-time algorithm when k
CITATION STYLE
Chen, L. H., Chang, M. S., Wang, C. C., & Wu, B. Y. (2013). On the min-max 2-cluster editing problem. Journal of Information Science and Engineering, 29(6), 1109–1121.
Mendeley helps you to discover research relevant for your work.