Abstract

In this paper, we study the Maximum Remove-r Distance-d Independence Set (MRrDdIS for short) problem. The goal of this problem is to maximize the size of a distance d-independent set by removing at most a specified number r of vertices from a given graph. This problem generalizes the Maximum Distance-d
... read more