Abstract
The MaxSTC problem is an assignment of the edges with strong or weak labels having the maximum number of strong edges such that any two vertices that have a common neighbor with a strong edge are adjacent. The Cluster Deletion problem seeks for the minimum number of edge removals of a given graph such that the remaining graph is a disjoint union of cliques. Both problems are known to be NP-hard and an optimal solution for the Cluster Deletion problem provides a solution for the MaxSTC problem, however not necessarily an optimal one. In this work we give the first systematic study that reveals graph families for which the optimal solutions for MaxSTC and Cluster Deletion coincide. We first show that MaxSTC coincides with Cluster Deletion on cographs and, thus, MaxSTC is solvable in quadratic time on cographs. As a side result, we give an interesting computational characterization of the maximum independent set on the cartesian product of two cographs. Furthermore we study how low degree bounds influence the complexity of the MaxSTC problem. We show that this problem is polynomial-time solvable on graphs of maximum degree three, whereas MaxSTC becomes NP-complete on graphs of maximum degree four. The latter implies that there is no subexponential-time algorithm for MaxSTC unless the Exponential-Time Hypothesis fails.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The \(O^*\) notation suppresses polynomial factors of n.
References
Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56, 89–113 (2004)
Bonomo, F., Durán, G., Valencia-Pabon, M.: Complexity of the cluster deletion problem on subclasses of chordal graphs. Theoret. Comput. Sci. 600, 59–69 (2015)
Brandstädt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics (1999)
Cochefert, M., Couturier, J.-F., Golovach, P.A., Kratsch, D., Paulusma, D.: Parameterized algorithms for finding square roots. Algorithmica 74, 602–629 (2016)
Corneil, D.G., Lerchs, H., Stewart, L.K.: Complement reducible graphs. Discret. Appl. Math. 3, 163–174 (1981)
Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926–934 (1985)
Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015)
Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York (2010)
Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)
Gao, Y., Hare, D.R., Nastos, J.: The cluster deletion problem for cographs. Discret. Math. 313, 2763–2771 (2013)
Granovetter, M.: The strength of weak ties. Am. J. Sociol. 78, 1360–1380 (1973)
Hon, W.-K., Kloks, T., Liu, H.-H., Poon, S.-H., Wang, Y.-L.: On independence domination. In: Gąsieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol. 8070, pp. 183–194. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40164-0_19
Imrich, W., Klavzar, S., Rall, D.F.: Topics in Graph Theory: Graphs and Their Cartesian Product. AK Peters Ltd., Wellesley (2008)
Jha, P.K., Slutzki, G.: Independence numbers of product graphs. Appl. Math. Lett. 7, 91–94 (1994)
Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discret. Appl. Math. 160, 2259–2270 (2012)
Konstantinids, A., Papadopoulos, C.: Maximizing the strong triadic closure in split graphs and proper interval graphs. CoRR, abs/1609.09433 (2016)
Le, V.B.: Gallai graphs and anti-gallai graphs. SIAM J. Discret. Math. 159, 179–189 (1996)
Shamir, R., Sharan, R.: A fully dynamic algorithm for modular decomposition and recognition of cographs. Discret. Appl. Math. 136, 329–340 (2004)
Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discret. Appl. Math. 144, 173–182 (2004)
Sintos, S., Tsaparas, P.: Using strong triadic closure to characterize ties in social networks. In: Proceedings of KDD 2014, pp. 1466–1475 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Konstantinidis, A.L., Nikolopoulos, S.D., Papadopoulos, C. (2017). Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. In: Cao, Y., Chen, J. (eds) Computing and Combinatorics. COCOON 2017. Lecture Notes in Computer Science(), vol 10392. Springer, Cham. https://doi.org/10.1007/978-3-319-62389-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-62389-4_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62388-7
Online ISBN: 978-3-319-62389-4
eBook Packages: Computer ScienceComputer Science (R0)