Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials

The theory of kernelization can be used to rigorously analyze data reduction for graph coloring problems. Here, the aim is to reduce a q - Coloring input to an equivalent but smaller input whose size is provably bounded in terms of structural properties, such as the size of a minimum vertex cover. I...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 81; no. 10; pp. 3865 - 3889
Main Authors:	Jansen, Bart M. P., Pieterse, Astrid
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2019 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data reduction Data Structures and Information Theory Graph coloring Homomorphisms Kernels Lower bounds Mathematics of Computing Parameterization Parameters Polynomials Special Issue: Parameterized and Exact Computation Theory of Computation Graph homomorphism Graph coloring 05C85 Kernelization 05C15
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!