5 citations · 5 across the 8 of their papers we have counts for
1 paper · 1 filter
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∈N and seeks to edit (add or delete) at most $…