Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/32899
- Linear kernels in linear time, or how to save k colours in O(n2) steps
- This paper examines a parameterized problem that we refer to as n - k GRAPH COLORING, i.e., the problem of determining whether a graph G with n vertices can be colored using n - k colors.
- 30th International Workshop, WG 2004. Graph-theoretic concepts in computer science : 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004 : revised papers (Bad Honnef, Germany June 21-23, 2004) p. 257-269
- Resource Type
- conference paper