• français
    • English
  • français 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Parameterized Complexity and Approximation Issues for the Colorful Components Problems

Thumbnail
Date
2016
Link to item file
https://arxiv.org/abs/1605.03071v1
Dewey
Recherche opérationnelle
Sujet
Parameterized Complexity; Approximation
DOI
http://dx.doi.org/10.1007/978-3-319-40189-8_27
Conference name
12th Conference on Computability in Europe, CiE 2016
Conference date
06-2016
Conference city
Paris
Conference country
France
Book title
Pursuit of the Universal. 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings
Author
Beckmann, Arnold; Bienvenu, Laurent; Jonoska, Nataša
Publisher
Springer International Publishing
Publisher city
Berlin
Year
2016
ISBN
978-3-319-40188-1
Book URL
10.1007/978-3-319-40189-8
URI
https://basepub.dauphine.fr/handle/123456789/15663
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Dondi, Riccardo
119452 Università degli Studi di Bergamo
Sikora, Florian
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Communication / Conférence
Item number of pages
261-270
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.