Year-end Sale % OFF 
Abstract
An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-vertices induce a 1-regular subgraph. An induced matching M is maximal if no other induced matching contains M . The Minimum Maximal Induced Matching problem asks for a minimum maximal induced matching in a given graph. The problem is known to be NP -complete. Here we show that, if P ≠ NP , for any ε > 0 , this problem cannot be approximated within a factor of n 1 − ε in polynomial time, where n denotes the number of vertices in the input graph. The result holds even if the graph in question is restricted to being bipartite. For the related problem of finding an induced matching of maximum size ( Maximum Induced Matching), it is shown that, if P ≠ NP , for any ε > 0 , the problem cannot be approximated within a factor of n 1 / 2 − ε in polynomial time. Moreover, we show that Maximum Induced Matching is NP -complete for planar line graphs of planar bipartite graphs.
Published Version (
Free)
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 callDisclaimer: 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.
