Parameterized Complexity and Approximation Issues for the Colorful Components Problems

The quest for colorful components (connected components where each color is associated with at most one vertex) inside a vertex-colored graph has been widely considered in the last ten years. Here we consider two variants, Minimum Colorful Components (MCC) and Maximum Edges in transitive Closure (MEC), introduced in the context of orthology gene identification in bioinformatics. The input of both MCC and MEC is a vertex-colored graph. MCC asks for the removal of a subset of edges, so that the resulting graph is partitioned in the minimum number of colorful connected components; MEC asks for the removal of a subset of edges, so that the resulting graph is partitioned in colorful connected components and the number of edges in the transitive closure of such a graph is maximized. We study the parameterized and approximation complexity of MCC and MEC, for general and restricted instances.

[1]  Christian Komusiewicz,et al.  New Races in Parameterized Algorithmics , 2012, MFCS.

[2]  Cristina G. Fernandes,et al.  Motif Search in Graphs: Application to Metabolic Networks , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[3]  Anna Adamaszek,et al.  Algorithmic and Hardness Results for the Colorful Components Problems , 2014, LATIN.

[4]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[5]  Riccardo Dondi,et al.  Complexity issues in vertex-colored graph pattern matching , 2011, J. Discrete Algorithms.

[6]  Ge Xia,et al.  Improved parameterized and exact algorithms for cut problems on trees , 2015, Theor. Comput. Sci..

[7]  Michael R. Fellows,et al.  Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows , 2015, SIGA.

[8]  David Sankoff,et al.  OMG! Orthologs in Multiple Genomes - Competing Graph-Theoretical Formulations , 2011, WABI.

[9]  Christian Komusiewicz,et al.  Partitioning into Colorful Components by Minimum Edge Deletions , 2012, CPM.

[10]  Riccardo Dondi,et al.  Finding approximate and constrained motifs in graphs , 2013, Theor. Comput. Sci..

[11]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[12]  Noga Alon,et al.  Solving MAX-r-SAT Above a Tight Lower Bound , 2010, SODA '10.

[13]  Guillaume Blin,et al.  Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem , 2014, IWOCA.

[14]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[15]  Christian Komusiewicz,et al.  Parameterized Algorithmics for Finding Connected Motifs in Biological Networks , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[16]  Jianer Chen,et al.  Multicut in trees viewed through the eyes of vertex cover , 2011, J. Comput. Syst. Sci..