A quasi-quadratic vertex-kernel for Cograph Edge Editing

We provide a O(k2logk) vertex kernel for cograph edge editing. This improves a cubic kernel found by Guillemot, Havet, Paul and Perez (Guillemot et al., 2010) which involved four reduction rules. We generalize one of their rules, based on packing of induced paths of length four, by introducing t-mod...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 357; pp. 282 - 296
Main Authors:	Crespelle, Christophe, Pellerin, Rémi, Thomassé, Stéphan
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.11.2024 Elsevier
Subjects:	Cographs Computer Science Kernelization algorithms Parameterized complexity Cographs 68R10 05C85 Kernelization algorithms Parameterized complexity 68Q27
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!