Sign Up to like & get
recommendations!
0
Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0401-6
Abstract: We give a kernel with $$O(k^7)$$O(k7) vertices for Trivially Perfect Editing, the problem of adding or removing at most k edges in order to make a given graph trivially perfect. This answers in affirmative an…
read more here.
Keywords:
perfect editing;
trivially perfect;
polynomial kernel;
kernel trivially ... See more keywords