Perfect Matching Interdiction Problem Restricted to a Stable Vertex
Suppose v is the stable vertex of a weighted graph G. The purpose of the perfect matching interdiction problem restricted to the stable vertex v in G is to remove v and a vertex adjacent to v such that the weight of the maximum perfect matching in the resulting graph is minimized. In this paper, we present an approximate solution for this problem. According to the approximate and optimal solutions, a special ratio is introduced for this problem. This ratio is not bounded from above and we obtain it for some special classes of graphs.
KeywordsPerfect matching Interdiction Stable vertex Weighted graph
Mathematics Subject Classification05C70