Journal of Algorithms
Problems and results in combinatorial analysis and graph theory
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Irredundancy in circular arc graphs
Discrete Applied Mathematics
Discrete Mathematics
Generalizing NP-completeness proofs for bipartite graphs and chordal graphs
Generalizing NP-completeness proofs for bipartite graphs and chordal graphs
Maximum induced matchings in graphs
Discrete Mathematics
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
SIAM Journal on Computing
Graph classes: a survey
New results on induced matchings
Discrete Applied Mathematics
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Independent Sets in Asteroidal Triple-Free Graphs
SIAM Journal on Discrete Mathematics
Finding a maximum induced matching in weakly chordal graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Bipartite Domination and Simultaneous Matroid Covers
SIAM Journal on Discrete Mathematics
Induced matchings in asteroidal triple-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Graphs and Hypergraphs
Graph Theory With Applications
Graph Theory With Applications
The Pk Partition Problem and Related Problems in Bipartite Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Tighter approximations for maximum induced matchings in regular graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Independent domination in chordal graphs
Operations Research Letters
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical Computer Science
Complexity of finding maximum regular induced subgraphs with prescribed degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
An induced matchingM 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 PNP, for any @e0, this problem cannot be approximated within a factor of n^1^-^@e 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 PNP, for any @e0, the problem cannot be approximated within a factor of n^1^/^2^-^@e in polynomial time. Moreover, we show that Maximum Induced Matching is NP-complete for planar line graphs of planar bipartite graphs.