![Graph coloring / NP-complete problems / Analysis of algorithms / Parameterized complexity / List coloring / Graph / Travelling salesman problem / Kernelization / Edge coloring / Graph theory / Theoretical computer science / Mathematics Graph coloring / NP-complete problems / Analysis of algorithms / Parameterized complexity / List coloring / Graph / Travelling salesman problem / Kernelization / Edge coloring / Graph theory / Theoretical computer science / Mathematics](https://www.pdfsearch.io/img/08b882d277fed4e944b6bf12c7a882c5.jpg)
| Document Date: 2013-02-01 23:13:02 Open Document File Size: 646,98 KBShare Result on Facebook
City San Diego / / IndustryTerm search trees / Local search variant / local search / / Organization Rolf Niedermeier TU Berlin Institut f¨ / / Person Rolf Niedermeier Incremetal / Sepp Hartung / Rolf Niedermeier Incremetal List Coloring / Rolf Niedermeier / / ProgrammingLanguage TSP / / PublishedMedium Theoretical Computer Science / / URL http /
SocialTag |