Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: International Journal of Applied and Computational Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
