Twin-width and Polynomial Kernels

We study the existence of polynomial kernels, for parameterized problems without a polynomial kernel on general graphs, when restricted to graphs of bounded twin-width. Our main result is that a polynomial kernel for k -Dominating Set on graphs of twin-width at most 4 would contradict a standard com...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 84; no. 11; pp. 3300 - 3337
Main Authors:	Bonnet, Édouard, Kim, Eun Jung, Reinald, Amadeus, Thomassé, Stéphan, Watrigant, Rémi
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2022 Springer Nature B.V Springer Verlag
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graphs Kernels Lower bounds Mathematics of Computing Optimization Polynomials Special Issue on Parameterized and Exact Computation (IPEC 2021) Theory of Computation Upper bounds Twin-width Lower bounds Dominating Set Kernelization
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!