![Graph coloring / NP-complete problems / List coloring / Parameterized complexity / Kernelization / Vertex cover / Independent set / Edge coloring / Complete coloring / Graph theory / Theoretical computer science / Mathematics Graph coloring / NP-complete problems / List coloring / Parameterized complexity / Kernelization / Vertex cover / Independent set / Edge coloring / Complete coloring / Graph theory / Theoretical computer science / Mathematics](https://www.pdfsearch.io/img/f32666e22eb425a4f6193482ce3a3c06.jpg)
| Document Date: 2013-01-22 17:08:40 Open Document File Size: 495,83 KBShare Result on Facebook
City Berlin / Prague / / Company IBM Germany / / Country Czech Republic / / / IndustryTerm fixed-parameter algorithm / trivial solution / polynomial-time algorithm / polynomial-time approximation algorithms / straightforward brute-force algorithm / iterative local search heuristic / fixedparameter algorithms / search tree strategy showing / local search approach / l-local search / local search / / Organization Institut f¨ / / Person Rolf Niedermeiera / Rolf Niedermeier / / Position first author / / Technology corresponding algorithm / polynomial-time approximation algorithms / fixed-parameter algorithm / straightforward brute-force algorithm / fixedparameter algorithms / polynomial-time algorithm / /
SocialTag |