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
Induced matchings in cubic graphs
Journal of Graph Theory
Irredundancy in circular arc graphs
Discrete Applied Mathematics
Discrete Mathematics
New results on induced matchings
Discrete Applied Mathematics
Induced Matchings in Regular Graphs and Trees
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Packing vertices and edges in random regular graphs
Random Structures & Algorithms
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
The parameterized complexity of the induced matching problem in planar graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical Computer Science
| Hi-index | 0.00 |
An induced matching is a matching in which each two edges of the matching are not connected by a joint edge. Induced matchings are well-studied combinatorial objects and a lot of consideration has been given to finding maximum induced matchings, which is an NP-complete problem. Specifically, finding maximum induced matchings in regular graphs is well-known to be NP-complete. A couple of papers lately showed a couple of simple greedy algorithm that approximate a maximum induced matching with a factor of $d - {\frac{1}{2}}$ and d−1 (different papers – different factors), where d is the degree of regularity. We show here a simple algorithm with an 0.75d + 0.15 approximation factor. The algorithm is simple – the analysis is not.