Back to Results
First PageMeta Content
NP-complete problems / Graph coloring / Degeneracy / Vertex cover / Edge coloring / Clique / Vertex / Graph / Dense subgraph / Graph theory / Theoretical computer science / Mathematics


The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German
Add to Reading List

Document Date: 2014-07-31 12:35:33


Open Document

File Size: 383,10 KB

Share Result on Facebook

Company

Vertex / /

Country

France / /

Currency

pence / /

/

IndustryTerm

greedy solution / polynomial-space algorithm / fixedparameter algorithm / minimal solution / superpolynomial time algorithms / exhaustive search / log p-approximation algorithm / large solutions / /

Organization

Martin Rötzschke Institut für Softwaretechnik / /

Person

Rolf Niedermeier / Martin Rötzschke / Christian Komusiewicz / /

Position

General / /

Technology

fixedparameter algorithm / bioinformatics / slightly superpolynomial time algorithms / genotype / polynomial-space algorithm / log p-approximation algorithm / DNA Chip / time algorithm / /

SocialTag