An improved branching algorithm for the proper interval edge deletion problem

摘要

1 Introduction For a graph class G,the G-EDGE DELETION problem is to determine whether a given graph can be transformed into a graph in G by deleting at most k ecdges.The G-EDGE DELETION problem for a large body of graph classes G has long been studied in the literature.