Abstract
Given an undirected graph G = (V, E) and two integers k and h, we study Th+1-FREE EDGE DELETION, where the goal is to remove at most k edges such that......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
