Maximizing the strong triadic closure in split graphs and proper interval graphs

Abstract 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 incomparable 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.

[1]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[2]  Lap Chi Lau,et al.  Bipartite roots of graphs , 2004, TALG.

[3]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[4]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[5]  Kurt Mehlhorn,et al.  Certifying algorithms for recognizing interval graphs and permutation graphs , 2003, SODA '03.

[6]  G. Khosrovshahi,et al.  Computing the bandwidth of interval graphs , 1990 .

[7]  Lap Chi Lau,et al.  Recognizing Powers of Proper Interval, Split, and Chordal Graph , 2004, SIAM J. Discret. Math..

[8]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[9]  Martin Charles Golumbic,et al.  Trivially perfect graphs , 1978, Discret. Math..

[10]  Flavia Bonomo,et al.  Complexity of the cluster deletion problem on subclasses of chordal graphs , 2015, Theor. Comput. Sci..

[11]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[12]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[13]  Petr A. Golovach,et al.  Parameterized Algorithms for Finding Square Roots , 2014, Algorithmica.

[14]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[15]  Peter L. Hammer,et al.  Difference graphs , 1990, Discret. Appl. Math..

[16]  Blair D. Sullivan,et al.  Tree decompositions and social graphs , 2014, Internet Math..

[17]  Martin Milanic,et al.  Computing square roots of trivially perfect and threshold graphs , 2013, Discret. Appl. Math..

[18]  Jayme Luiz Szwarcfiter,et al.  Applying Modular Decomposition to Parameterized Cluster Editing Problems , 2008, Theory of Computing Systems.

[19]  Louis Ibarra,et al.  The clique-separator graph for chordal graphs , 2009, Discret. Appl. Math..

[20]  S. Olariu,et al.  Optimal greedy algorithms for indifference graphs , 1992, Proceedings IEEE Southeastcon '92.

[21]  Van Bang Le,et al.  Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs , 2014, Theor. Comput. Sci..

[22]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[23]  Xiaotie Deng,et al.  Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs , 1996, SIAM J. Comput..

[24]  Van Bang Le.  Gallai graphs and anti-Gallai graphs , 1996, Discret. Math..

[25]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.