Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters

Authors Ivan Bliznets, Nikolai Karpov

Thumbnail PDF


  • Filesize: 488 kB
  • 14 pages

Document Identifiers

Author Details

Ivan Bliznets
Nikolai Karpov

Cite AsGet BibTex

Ivan Bliznets and Nikolai Karpov. Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


Clustering is a well-known and important problem with numerous applications. The graph-based model is one of the typical cluster models. In the graph model generally clusters are defined as cliques. However, such approach might be too restrictive as in some applications, not all objects from the same cluster must be connected. That is why different types of cliques relaxations often considered as clusters. In our work, we consider a problem of partitioning graph into clusters and a problem of isolating cluster of a special type where by cluster we mean highly connected subgraph. Initially, such clusterization was proposed by Hartuv and Shamir. And their HCS clustering algorithm was extensively applied in practice. It was used to cluster cDNA fingerprints, to find complexes in protein-protein interaction data, to group protein sequences hierarchically into superfamily and family clusters, to find families of regulatory RNA structures. The HCS algorithm partitions graph in highly connected subgraphs. However, it is achieved by deletion of not necessarily the minimum number of edges. In our work, we try to minimize the number of edge deletions. We consider problems from the parameterized point of view where the main parameter is a number of allowed edge deletions. The presented algorithms significantly improve previous known running times for the Highly Connected Deletion (improved from \cOs\left(81^k\right) to \cOs\left(3^k\right)), Isolated Highly Connected Subgraph (from \cOs(4^k) to \cOs\left(k^{\cO\left(k^{\sfrac{2}{3}}\right)}\right) ), Seeded Highly Connected Edge Deletion (from \cOs\left(16^{k^{\sfrac{3}{4}}}\right) to \cOs\left(k^{\sqrt{k}}\right)) problems. Furthermore, we present a subexponential algorithm for Highly Connected Deletion problem if the number of clusters is bounded. Overall our work contains three subexponential algorithms which is unusual as very recently there were known very few problems admitting subexponential algorithms.
  • clustering
  • parameterized complexity
  • highly connected


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Balabhaskar Balasundaram, Sergiy Butenko, and Illya V Hicks. Clique relaxations in social network analysis: The maximum k-plex problem. Operations Research, 59(1):133-142, 2011. Google Scholar
  2. Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Fourier meets möbius: fast subset convolution. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pages 67-74, 2007. URL:
  3. Gary Chartrand. A graph-theoretic approach to a communications problem. SIAM Journal on Applied Mathematics, 14(4):778-781, 1966. Google Scholar
  4. Wladimir de Azevedo Pribitkin. Simple upper bounds for partition functions. The Ramanujan Journal, 18(1):113-119, 2009. URL:
  5. Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, and Yngve Villanger. Tight bounds for parameterized complexity of cluster editing with a small number of clusters. J. Comput. Syst. Sci., 80(7):1430-1447, 2014. URL:
  6. Fedor V. Fomin and Yngve Villanger. Treewidth computation and extremal combinatorics. Combinatorica, 32(3):289-308, 2012. URL:
  7. Jiong Guo, Iyad A Kanj, Christian Komusiewicz, and Johannes Uhlmann. Editing graphs into disjoint unions of dense clusters. Algorithmica, 61(4):949-970, 2011. Google Scholar
  8. Erez Hartuv, Armin O Schmitt, Jörg Lange, Sebastian Meier-Ewert, Hans Lehrach, and Ron Shamir. An algorithm for clustering cdna fingerprints. Genomics, 66(3):249-256, 2000. Google Scholar
  9. Erez Hartuv and Ron Shamir. A clustering algorithm based on graph connectivity. Inf. Process. Lett., 76(4-6):175-181, 2000. URL:
  10. Wayne Hayes, Kai Sun, and Nataša Pržulj. Graphlet-based measures are suitable for biological network comparison. Bioinformatics, 29(4):483-491, 2013. Google Scholar
  11. Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, and Rolf Niedermeier. Partitioning biological networks into connected clusters with maximum edge coverage. IEEE/ACM Trans. Comput. Biology Bioinform., 11(3):455-467, 2014. URL:
  12. Falk Hüffner, Christian Komusiewicz, and Manuel Sorge. Finding highly connected subgraphs. In SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings, pages 254-265, 2015. URL:
  13. Antje Krause, Jens Stoye, and Martin Vingron. Large scale hierarchical clustering of protein sequences. BMC bioinformatics, 6(1):15, 2005. Google Scholar
  14. Hannes Moser, Rolf Niedermeier, and Manuel Sorge. Algorithms and experiments for clique relaxations—finding maximum s-plexes. In International Symposium on Experimental Algorithms, pages 233-244. Springer, 2009. Google Scholar
  15. Brian J Parker, Ida Moltke, Adam Roth, Stefan Washietl, Jiayu Wen, Manolis Kellis, Ronald Breaker, and Jakob Skou Pedersen. New families of human regulatory rna structures identified by comparative analysis of vertebrate genomes. Genome research, 21(11):1929-1943, 2011. Google Scholar
  16. Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, and Vladimir Boginski. On the maximum quasi-clique problem. Discrete Applied Mathematics, 161(1):244-257, 2013. Google Scholar
  17. Jeffrey Pattillo, Nataly Youssef, and Sergiy Butenko. On clique relaxation models in network analysis. European Journal of Operational Research, 226(1):9-18, 2013. Google Scholar
  18. Jeffrey Pattillo, Nataly Youssef, and Sergiy Butenko. On clique relaxation models in network analysis. European Journal of Operational Research, 226(1):9-18, 2013. URL:
  19. Alexander Schäfer. Exact algorithms for s-club finding and related problems. PhD thesis, Friedrich-Schiller-University Jena, 2009. Google Scholar
  20. Shahram Shahinpour and Sergiy Butenko. Distance-based clique relaxations in networks: s-clique and s-club. In Models, algorithms, and technologies for network analysis, pages 149-174. Springer, 2013. Google Scholar
  21. Haiyuan Yu, Alberto Paccanaro, Valery Trifonov, and Mark Gerstein. Predicting interactions in protein networks by completing defective cliques. Bioinformatics, 22(7):823-829, 2006. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail