An O ∗ (1.4786n)-Time Algorithm for the Maximum Induced Matching Problem
Given a graph G = (V, E) the Maximum r -Regular Induced Subgraph problem is to find a vertex set R ⊆ V of maximum cardinality such that G[R] is r-regular. An induced matching M ⊆ E in a graph G = (V, E) is a matching such that no two edges in M are joined by any third edge of the graph. The Maximum Induced Matching problem is to find an induced matching of maximum cardinality. By definition the maximum induced matching problem is the maximum 1-regular induced subgraph problem. Gupta et al. gave an o(2 n ) time algorithm for solving the Maximum r -Regular Induced Subgraph problem. This algorithm solves the Maximum Induced Matching problem in time O ∗ (1.6957 n ) where n is the number of vertices in the input graph. In this paper, we show that the maximum induced matching problem can be reduced to the maximum independent set problem and we give a more efficient algorithm for the Maximum Induced Matching problem running in time O ∗ (1.4786 n ).
Unable to display preview. Download preview PDF.
- 1.Binkele-Raible, D., Brankovic, L., Cygan, M., Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Pilipczuk, M., Rossmanith, P., Wojtaszczyk, J.O.: Breaking the 2n–barrier for irredundance: two lines of attack. Journal of Discrete Algorithms 9, 214–230 (2011)MathSciNetMATHCrossRefGoogle Scholar
- 2.Cardoso, D.M., Kaminski, M., Lozin, V.: Maximum k-Regular Induced Subgraphs. Rutcor Research Report (RRR) 3 (2006)Google Scholar
- 7.Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer (2010)Google Scholar
- 16.Lozin, V.V., Mosca, R.: Maximum regular induced subgraphs in 2P 3-free graphs. In: Theoretical Computer Science (2012), doi:10.1016/j.tcs.2012.06.014Google Scholar