A cubic vertex-kernel for Trivially Perfect Editing

Maël Dumas, Anthony Perez, Ioan Todinca

We consider the Trivially Perfect Editing problem, where one is given an undirected graph $G=(V,E)$ and a parameter $k\in \mathbb{N}$ and seeks to edit (add or delete) at most $…