Prafullkumar Prabhakar Tale
(The Institute of Mathematical Sciences, 2020)
For a family of graphs F , the F -E DITING problem takes as an input a graph G and an
integer k, and the objective is to decide if at most k edit operations on G can result in a
graph that belongs to F . Various graph ...