Problems and results in combinatorial analysis and graph theory
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Induced matchings in bipartite graphs
Discrete Mathematics - In memory of Tory Parsons
Discrete Mathematics
Computational Complexity
Maximum induced matchings in graphs
Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Packing Edges in Random Regular Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the induced matching problem
Journal of Computer and System Sciences
Tighter approximations for maximum induced matchings in regular graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Generalizing the induced matching by edge capacity constraints
Discrete Optimization
Maximum regular induced subgraphs in 2P3-free graphs
Theoretical Computer Science
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical Computer Science
Maximum matching in multi-interface networks
Theoretical Computer Science
| Hi-index | 0.00 |
This paper studies the complexity of the Maximum Induced Matching problem (MIM) in regular graphs and trees. We show that the largest induced matchings in a regular graph of degree d can be approximated with a performance ratio less than d. However MIM is NP-hard to approximate within some constant c 1 even if the input is restricted to various classes of bounded degree and regular graphs. Finally we describe a simple algorithm providing a linear time optimal solution to MIM if the input graph is a tree.