Document Open Access Logo

Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs

Authors Athanasios L. Konstantinidis, Charis Papadopoulos

Thumbnail PDF


  • Filesize: 0.51 MB
  • 12 pages

Document Identifiers

Author Details

Athanasios L. Konstantinidis
Charis Papadopoulos

Cite AsGet BibTex

Athanasios L. Konstantinidis and Charis Papadopoulos. Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 53:1-53:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


In social networks the Strong Triadic Closure is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of strong edges that satisfy the strong triadic closure was recently shown to be NP-complete for general graphs. Here we initiate the study of graph classes for which the problem is solvable. We show that the problem admits a polynomial-time algorithm for two unrelated classes of graphs: proper interval graphs and trivially-perfect graphs. To complement our result, we show that the problem remains NP-complete on split graphs, and consequently also on chordal graphs. Thus we contribute to define the first border between graph classes on which the problem is polynomially solvable and on which it remains NP-complete.
  • strong triadic closure
  • polynomial-time algorithm
  • NP-completeness
  • split graphs
  • proper interval graphs


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


  1. A. B. Adcock, B. D. Sullivan, and M. W. Mahoney. Tree decompositions and social graphs. Internet Mathematics, 12:315-361, 2016. Google Scholar
  2. L. Backstrom and J. Kleinberg. Romantic partnerships and the dispersion of social ties: a network analysis of relationship status on facebook. In Proceedings of CSCW 2014, pages 831-841, 2014. Google Scholar
  3. F. Bonomo, G. Durán, and M. Valencia-Pabon. Complexity of the cluster deletion problem on subclasses of chordal graphs. Theoretical Computer Science, 600:59-69, 2015. Google Scholar
  4. A. Brandstädt, V. B. Le, and J. Spinrad. Graph Classes: A Survey. Society for Industrial and Applied Mathematics, 1999. Google Scholar
  5. M. Cochefert, J.-F. Couturier, P. A. Golovach, D. Kratsch, and D. Paulusma. Parameterized algorithms for finding square roots. Algorithmica, 74:602-629, 2016. Google Scholar
  6. D.G. Corneil, H. Lerchs, and L.K. Stewart. Complement reducible graphs. Discrete Applied Mathematics, 3:163-174, 1981. Google Scholar
  7. B. Courcelle. The monadic second-order logic of graphs i: Recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990. Google Scholar
  8. X. Deng, P. Hell, and J. Huang. Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs. SIAM J. Comput., 25:390-403, 1996. Google Scholar
  9. D. Easley and J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010. Google Scholar
  10. J. Edmonds. Paths, trees and flowers. Canad. J. Math., 17:449-467, 1965. Google Scholar
  11. M.C. Golumbic. Trivially perfect graphs. Discrete Mathematics, 24:105-107, 1978. Google Scholar
  12. M. Granovetter. The strength of weak ties. American J. of Sociology, 78:1360-1380, 1973. Google Scholar
  13. M. Grötschel. Polynomial algorithms for perfect graphs. North-Holland Mathematics Studies, 21:325-356, 1984. Google Scholar
  14. P. Heggernes, D. Lokshtanov, J. Nederlof, C. Paul, and J. A. Telle. Generalized graph clustering: recognizing (p,q)-cluster graphs. In Proceedings of WG 2010, pages 171-183, 2010. Google Scholar
  15. J. E. Hopcroft and R. M. Karp. An n^5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225-231, 1973. Google Scholar
  16. L. Ibarra. The clique-separator graph for chordal graphs. Discrete Applied Mathematics, 157:1737-1749, 2009. Google Scholar
  17. M. O. Jackson. Social and economic networks. Princeton University press, vol. 3, 2008. Google Scholar
  18. R. M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, pages 85-103, 1972. Google Scholar
  19. D. J. Kleitman and R. V. Vohra. Computing the bandwidth of interval graphs. SIAM J. Disc. Math., 3:373-375, 1990. Google Scholar
  20. L. C. Lau. Bipartite roots of graphs. ACM Transactions on Algorithms, 2:178-208, 2006. Google Scholar
  21. L. C. Lau and D. G. Corneil. Recognizing powers of proper interval, split, and chordal graphs. SIAM J. Disc. Math., 18:83-102, 2004. Google Scholar
  22. V. B. Le. Gallai graphs and anti-gallai graphs. Discrete Mathematics, 159:179-189, 1996. Google Scholar
  23. V. B. Le, A. Oversberg, and O. Schaudt. Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs. Theoretical Computer Science, 602:39-49, 2015. Google Scholar
  24. P. J. Looges and S. Olariu. Optimal greedy algorithms for indifference graphs. Computers &Mathematics with Applications, 25:15-25, 1993. Google Scholar
  25. M. Milanič and O. Schaudt. Computing square roots of trivially perfect and threshold graphs. Discrete Applied Mathematics, 161:1538-1545, 2013. Google Scholar
  26. J. L. Pfaltz. Chordless cycles in networks. In Proceedings of ICDE Workshops 2013, pages 223-228, 2013. Google Scholar
  27. F. S. Roberts. Indifference graphs. In Proof Techniques in Graph Theory, Academic Press, New York, pages 139-146, 1969. Google Scholar
  28. S. Sintos and P. Tsaparas. Using strong triadic closure to characterize ties in social networks. In Proceedings of KDD 2014, pages 1466-1475, 2014. Google Scholar
  29. J. Ugander, L. Backstrom, and J. Kleinberg. Subgraph frequencies: Mapping the empirical and extremal geography of large graph collections. In Proceedings of WWW 2013, pages 1307-1318, 2013. 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