Your rugby mates don't need to know your colleagues: Triadic closure with edge colors

Abstract Given an undirected graph G = ( V , E ) the NP-hard Strong Triadic Closure (STC) problem asks for a labeling of the edges as weak and strong such that at most k edges are weak and for each induced P 3 in G at least one edge is weak. We study the following generalizations of STC with c different strong edge colors. In Multi-STC an induced P 3 may receive two strong labels as long as they are different. In Edge-List Multi-STC and Vertex-List Multi-STC we may restrict the set of permitted colors for each edge of G. We show that, under the Exponential Time Hypothesis (ETH), Edge-List Multi-STC and Vertex-List Multi-STC cannot be solved in time 2 o ( | V | 2 ) . We proceed with a parameterized complexity analysis in which we extend previous algorithms and kernelizations for STC [Golovach et al., Algorithmica'20, Gruttemeier and Komusiewicz, Algorithmica'20] to the three variants or outline the limits of such an extension.

[1]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[2]  Jiong Guo.  A more effective linear kernelization for cluster editing , 2009, Theor. Comput. Sci..

[3]  Jianer Chen,et al.  A 2k kernel for the cluster editing problem , 2012, J. Comput. Syst. Sci..

[4]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[5]  Saket Saurabh,et al.  Kernelization Lower Bounds Through Colors and IDs , 2014, ACM Trans. Algorithms.

[6]  Stefan Kratsch,et al.  Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal , 2011, TALG.

[7]  Mark S. Granovetter.  T H E S T R E N G T H O F WEAK TIES: A NETWORK THEORY REVISITED , 1983 .

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

[9]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[10]  Petr A. Golovach,et al.  Parameterized Aspects of Strong Subgraph Closure , 2020, Algorithmica.

[11]  Charis Papadopoulos,et al.  Strong triadic closure in cographs and graphs of low maximum degree , 2018, Theor. Comput. Sci..

[12]  Stefan Kratsch,et al.  Kernelization Lower Bounds by Cross-Composition , 2012, SIAM J. Discret. Math..

[13]  Endre Szemerédi,et al.  A fast algorithm for equitable coloring , 2010, Comb..

[14]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[15]  Ge Xia,et al.  Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..

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

[17]  Charis Papadopoulos,et al.  Maximizing the strong triadic closure in split graphs and proper interval graphs , 2020, Discret. Appl. Math..

[18]  Juho Lauri,et al.  On the Fine-Grained Complexity of Rainbow Coloring , 2018, SIAM J. Discret. Math..

[19]  Liping Sun.  Two classes of perfect graphs , 1991, J. Comb. Theory, Ser. B.

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

[21]  Zvi Galil,et al.  NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.

[22]  Craig A. Tovey,et al.  A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..

[23]  Christian Komusiewicz,et al.  On the Relation of Strong Triadic Closure and Cluster Deletion , 2019, Algorithmica.