Paper Info
Title
Parameterized Complexity and Approximation Issues for the Colorful Components Problems.
Abstract
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 2011 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.
Year
DOI
Venue
2016
10.1016/j.tcs.2018.04.044
Theoretical Computer Science
Keywords
DocType
Volume
Colorful components,Parameterized complexity,Algorithms,Computational biology
Conference
739
ISSN
Citations 
PageRank 
0304-3975
2
0.38
References 
Authors
10
2
Name
Order
Citations
PageRank
Riccardo Dondi18918.42
Florian Sikora212414.44