The Parameterized Complexity of the Rainbow Subgraph Problem

The Parameterized Complexity of the Rainbow Subgraph Problem

The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices. We examine the parameterized complexity of RAINBOW SUBGRAPH for paths, trees, and general graphs. We sho...

Full description

Bibliographic Details
Main Authors: Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke
Format: Article
Language:English
Published: MDPI AG 2015-02-01
Series:Algorithms
Subjects:
APX-hardness
multivariate complexity analysis
fixed-parameter tractability
parameterized hardness
problem kernel
haplotyping
Online Access:http://www.mdpi.com/1999-4893/8/1/60

Internet

http://www.mdpi.com/1999-4893/8/1/60

Similar Items