- Title
- Linear kernels in linear time, or how to save k colours in O(n2) steps
- Creator
- Fellows, Mike; Juedes, David; Chor, Benny
- Relation
- 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
- Publisher
- Springer
- Resource Type
- conference paper
- Date
- 2004
- Description
- 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.
- Subject
- graph theory; graph covering; kernel method; graph colouring; linear time
- Identifier
- http://hdl.handle.net/1959.13/32899
- Identifier
- uon:3105
- Identifier
- ISBN:3540241329
- Language
- eng
- Reviewed
- Hits: 1023
- Visitors: 1182
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|