Back to Results
First PageMeta Content
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


Incremental List Coloring of Graphs, Parameterized by Conservation2 Sepp Hartung and Rolf Niedermeier TU Berlin Institut f¨ ur Softwaretechnik und Theoretische Informatik
Add to Reading List

Document Date: 2013-02-01 23:13:02

Open Document

File Size: 646,98 KB

Share 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