A new polynomial cluster deletion subproblem | IEEE Conference Publication | IEEE Xplore

A new polynomial cluster deletion subproblem


Abstract:

Cluster Deletion (CD) is a combinatorial problem which consists in transforming a given graph into a cluster graph by deleting as few edges as possible. CD arises in the ...Show More

Abstract:

Cluster Deletion (CD) is a combinatorial problem which consists in transforming a given graph into a cluster graph by deleting as few edges as possible. CD arises in the field of classification when the available data is in the form of graphs. In this paper, we introduce a graph transformation which allowed the identification of new polynomially solvable classes of CD. We show that if a graph is K3-free or (diamond, kite, house, xbanner)-free then cluster deletion can be solved in polynomial time on that graph. We also propose algorithms to detect forbidden patterns, a necessary task for identifying the discovered polynomial CD classes.
Date of Conference: 29 November 2016 - 02 December 2016
Date Added to IEEE Xplore: 12 June 2017
ISBN Information:
Electronic ISSN: 2161-5330
Conference Location: Agadir, Morocco

References

References is not available for this document.