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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 34; no. 1; pp. 47 - 63
Main Authors:	Chen, Li-Hsuan, Wu, Bang Ye
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2017 Springer Nature B.V
Subjects:	Algorithms Clustering Clusters Combinatorics Complexity Convex and Discrete Geometry Design parameters Editing Graph theory Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Parameterization Satellites Theory of Computation Subexponential algorithm Parameterized algorithm Graph modification Clustering Randomized algorithm Parameterized complexity
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!