论文部分内容阅读
This paper studies the following graph modification problem,called BOUNDED DEGREE EDGE DELETION: Given a simple undirected graph G and two non-negative integers d and k,one asks whether G can be transformed into a graph with maximum vertex degree at most d by removing at most k edges.