A new approximate cluster deletion algorithm for diamond-free graphs

  • Sabrine MalekEmail author
  • Wady Naanaa


The cluster deletion problem (CD) asks for transforming a given graph into a disjoint union of cliques by removing as few edges as possible. CD is among the most studied combinatorial optimization problem and, for general graphs, it is NP-hard. In the present paper, we identify a new polynomially solvable CD subproblem. We specifically propose a two-phase polynomial-time algorithm that optimally solves CD on the class of (butterfly,diamond)-free graphs. For this latter class of graphs, our two-phase algorithm provides optimal solutions even for another clustering variant, namely, cluster editing. Then, we propose a 2-optimal CD algorithm dedicated to the super-class of diamond-free graphs. For this class, we also show that CD, when parameterised by the number of deleted edges, admits a quadratic-size kernel. Finally, we report the results of experiments carried out on numerous diamond-free graphs, showing the effectiveness of the proposed approximate algorithm in terms of solution quality.


Cluster deletion (CD) Polynomial algorithm (Butterfly, diamond)-free graphs Maximal clique Suboptimal algorithm Diamond-free graphs 



  1. Bonomo F, Durn G, Napoli A, Valencia-Pabon M (2015) A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum colouring problem, and its application to \(P_4\)-sparse graphs. Inf Process Lett 115:600–603CrossRefGoogle Scholar
  2. Bonomo F, Durn G, Valencia-Pabon M (2015) Complexity of the cluster deletion problem on subclasses of chordal graphs. Theor Comput Sci 600:59–69MathSciNetCrossRefGoogle Scholar
  3. Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph (algorithm 457). Commun ACM 16(9):575–576CrossRefGoogle Scholar
  4. Cazals F, Karande C (2008) A note on the problem of reporting maximal cliques. Theor Comput Sci 407(1–3):564–568MathSciNetCrossRefGoogle Scholar
  5. Cygan M, Fedor V, Fomin FV, Kowalik L, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithms. Springer, BerlinCrossRefGoogle Scholar
  6. Edmonds J (1965) Maximum matching and a polyhedron with 0,1-vertices. J Res Natl Bureau Standards B Math Math Phys 69B:125–130MathSciNetCrossRefGoogle Scholar
  7. Fellows MR, Guo J, Komusiewicz C, Niedermeier R, Uhlmann J (2011) Graph-based data clustering with overlaps. Discrete Optim 8:2–17MathSciNetCrossRefGoogle Scholar
  8. Gao Y, Hare DR, Nastos J (2013) The cluster deletion problem for cographs. Discrete Math 313(23):2763–2771MathSciNetCrossRefGoogle Scholar
  9. Grüttemeier N, Komusiewicz C (2018) On the relation of strong triadic closure and cluster deletion. In: Proceedings of the \(44^{{\rm th}}\) WG. LNCS, (11159), pp 239–251. SpringerGoogle Scholar
  10. Guo J (2009) A more effective linear kernelization for cluster editing. Theor Comput Sci 410:718–726MathSciNetCrossRefGoogle Scholar
  11. Johnson DS, Papadimitriou CH, Yannakakis M (1988) On generating all maximal independent sets. Inf Process Lett 27(3):119–123MathSciNetCrossRefGoogle Scholar
  12. Komusiewicz C, Uhlmann J (2012) Cluster editing with locally bounded modifications. Discrete Appl Math 160(15):259–2270MathSciNetCrossRefGoogle Scholar
  13. Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78:046110CrossRefGoogle Scholar
  14. Makino K, Uno T (2004) New algorithms for enumerating all maximal cliques. In: Scandinavian workshop on algorithm theory, pp 260–272. SpringerGoogle Scholar
  15. Mamalis B, Gavalas D, Konstantopoulos C, Pantziou G (2009) Clustering in wireless sensor networks. In: RFID and sensor networks. CRC Press, pp 343–374Google Scholar
  16. Natanzon A, Shamir R, Sharan R (2001) Complexity classification of some edge modification problems. Discrete Appl Math 113:109–128MathSciNetCrossRefGoogle Scholar
  17. Pipenbacher PS, Schneckener A, Schnhuth S, Schomburg A, Schrader DR (1964) ProClust: improved clustering of protein sequences with an extended graph-based approach. Bioinformatics 18(Suppl 2):182–191CrossRefGoogle Scholar
  18. Shamir RS, Tsur RD (2002) Cluster graph modification problems. Discrete Appl Math 144(12):173–182MathSciNetzbMATHGoogle Scholar
  19. Sharan R, Maron-Katz A, Shamir R (2003) CLICK and EXPANDER: a system for clustering and visualizing gene expression data, Bioinformatics, vol 19, pp 1787–1799, 2003. In: A preliminary version appeared in proceedings of the 8th international conference on intelligent systems for molecular biology (ISMB), pp 307–316, AAAI Press, New York, 2000CrossRefGoogle Scholar
  20. Tomita E, Kameda T (2007) An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J Glob Optim 37(1):95–111MathSciNetCrossRefGoogle Scholar
  21. Tsukiyama S, Ide M, Ariyoshi H, Shirakawa I (1977) A new algorithm for generating all the maximal independent sets. SIAM J Comput 6(3):505–517MathSciNetCrossRefGoogle Scholar
  22. Ur Rehman S, Ullah KA, Fong S (2012) Graph mining: A survey of graph mining techniques. In: International conference on digital information management, ICDIM, pp 88–92Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Faculty of Economics and Management of SfaxUniversity of SfaxSfaxTunisia
  2. 2.National Engineering School of TunisUniversity of Tunis El ManarTunisTunisia

Personalised recommendations