Parameterized Algorithms for Module Map Problems

We introduce and study the NP-hard Module Map problem which has as input a graph G with red and blue edges and asks to transform G by at most k edge modifications into a graph which does not contain a two-colored \(K_3\), that is, a triangle with two blue edges and one red edge, a blue \(P_3\), that is, a path on three vertices with two blue edges, and a two-colored \(P_3\), that is, a path on three vertices with one blue and one red edge, as induced subgraph. We show that Module Map can be solved in \(\mathcal {O}(2^k \cdot n^3)\) time on n-vertex graphs and present a problem kernelization with \(\mathcal {O}(k^2)\) vertices.

[1]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation , 2005, Theory of Computing Systems.

[2]  Sebastian Böcker,et al.  Going weighted: Parameterized algorithms for cluster editing , 2008, Theor. Comput. Sci..

[3]  Christian Komusiewicz,et al.  Assessing the computational complexity of multilayer subgraph detection , 2016, Network Science.

[4]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[5]  Jiehua Chen,et al.  Cluster Editing for Multi-Layer and Temporal Graphs , 2017, Theory of Computing Systems.

[6]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[7]  Mirko Krivánek,et al.  NP-hard problems in hierarchical-tree clustering , 1986, Acta Informatica.

[8]  Sebastian Böcker,et al.  Exact Algorithms for Cluster Editing: Evaluation and Experiments , 2008, Algorithmica.

[9]  Christian Komusiewicz,et al.  Cluster editing with locally bounded modifications , 2012, Discret. Appl. Math..

[10]  R. Shamir,et al.  From E-MAPs to module maps: dissecting quantitative genetic interactions using physical interactions , 2008, Molecular systems biology.

[11]  Anthony Wirth,et al.  Correlation Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[12]  Saket Saurabh,et al.  Simultaneous Feedback Vertex Set: A Parameterized Perspective , 2015, TOCT.

[13]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[14]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[15]  Christian Komusiewicz,et al.  Destroying Bicolored P3s by Deleting Few Edges , 2019, CiE.

[16]  Michal Pilipczuk,et al.  Tight bounds for Parameterized Complexity of Cluster Editing , 2013, STACS.

[17]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[18]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[19]  Jiehua Chen,et al.  A Parameterized View on Multi-Layer Cluster Editing , 2017, ArXiv.

[20]  Ron Shamir,et al.  Constructing module maps for integrated analysis of heterogeneous biological networks , 2014, Nucleic acids research.

[21]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[22]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[23]  Fahad Panolan,et al.  Simultaneous Feedback Edge Set: A Parameterized Perspective , 2016, ISAAC.

[24]  Roded Sharan,et al.  Cluster graph modification problems , 2002, Discret. Appl. Math..

[25]  Christian Komusiewicz,et al.  Parameterizing Edge Modification Problems Above Lower Bounds , 2015, Theory of Computing Systems.

[26]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[27]  Fabrizio Grandoni,et al.  Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms , 2005, Bull. EATCS.

[28]  Holger H. Hoos,et al.  Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing , 2015, LION.

[29]  Alon Itai,et al.  Finding a Minimum Circuit in a Graph , 1978, SIAM J. Comput..

[30]  Amir Abboud,et al.  Tight Hardness Results for LCS and Other Sequence Similarity Measures , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.