![NP-complete problems / Graph coloring / Degeneracy / Vertex cover / Edge coloring / Clique / Vertex / Graph / Dense subgraph / Graph theory / Theoretical computer science / Mathematics NP-complete problems / Graph coloring / Degeneracy / Vertex cover / Edge coloring / Clique / Vertex / Graph / Dense subgraph / Graph theory / Theoretical computer science / Mathematics](https://www.pdfsearch.io/img/702cf50f5e2d20bfd0e56b28e8636d60.jpg) Date: 2014-07-31 12:35:33NP-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, GermanAdd to Reading ListSource URL: fpt.akt.tu-berlin.deDownload Document from Source Website File Size: 383,10 KBShare Document on Facebook
|