Parameterized Complexity and Approximation Issues for the Colorful Components Problems
Dondi, Riccardo; Sikora, Florian (2016), Parameterized Complexity and Approximation Issues for the Colorful Components Problems, in Beckmann, Arnold; Bienvenu, Laurent; Jonoska, Nataša, Pursuit of the Universal. 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings, Springer International Publishing : Berlin, p. 261-270. 10.1007/978-3-319-40189-8_27
Type
Communication / ConférenceExternal document link
https://arxiv.org/abs/1605.03071v1Date
2016Conference title
12th Conference on Computability in Europe, CiE 2016Conference date
2016-06Conference city
ParisConference country
FranceBook title
Pursuit of the Universal. 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, ProceedingsBook author
Beckmann, Arnold; Bienvenu, Laurent; Jonoska, NatašaPublisher
Springer International Publishing
Published in
Berlin
ISBN
978-3-319-40188-1
Pages
261-270
Publication identifier
Metadata
Show full item recordAuthor(s)
Dondi, RiccardoSikora, Florian

Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
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.Subjects / Keywords
Parameterized Complexity; ApproximationRelated items
Showing items related by title and author.
-
Dondi, Riccardo; Sikora, Florian (2018) Article accepté pour publication ou publié
-
Sikora, Florian; Dondi, Riccardo (2021) Communication / Conférence
-
Dondi, Riccardo; Mauri, Giancarlo; Sikora, Florian; Zoppis, Italo (2018) Communication / Conférence
-
Bonnet, Édouard; Paschos, Vangelis; Sikora, Florian (2016) Article accepté pour publication ou publié
-
Bazgan, Cristina; Foucaud, Florent; Sikora, Florian (2019) Article accepté pour publication ou publié