An improved kernelization algorithm for Trivially Perfect Editing

Maël Dumas, Anthony Perez

In the Trivially Perfect Editing problem one is given an undirected graph $G=(V,E)$ and an integer $k$ and seeks to add or delete at most $k$ edges in $G$ to obtain a trivially p…