A Polynomial Kernel for Diamond-Free Editing
Sign Up to like & getrecommendations! Published in 2022 at "Algorithmica"
DOI: 10.1007/s00453-021-00891-y
Abstract: Given a fixed graph H , the H -free editing problem asks whether we can edit at most k edges to make a graph contain no induced copy of H . We obtain a polynomial… read more here.
Keywords: diamond free; polynomial kernel; problem; dichotomy ... See more keywords