Parameterized algorithms for min–max 2-cluster editing

For a given graph and an integer t , the Min – Max 2-Clustering problem asks if there exists a modification of a given graph into two maximal disjoint cliques by inserting or deleting edges such that the number of the editing edges incident to each vertex is at most t . It has been shown that the pr...

Ausführliche Beschreibung