Finding a maximum induced matching in weakly chordal graphs

Kathie Cameron, R. Sritharan, Yingwen Tang
2003 Discrete Mathematics  
An induced matching in a graph G is a set of edges, no two of which meet a common vertex or are joined by an edge of G; that is, an induced matching is a matching which forms an induced subgraph. It is known that ÿnding an induced matching of maximum cardinality in a graph is NP-hard. We show that a maximum induced matching in a weakly chordal graph can be found in polynomial time. This generalizes previously known results for the induced matching problem. This also demonstrates that the
more » ... induced matching problem in chordal bipartite graphs can be solved in polynomial time while the problem is known to be NP-hard for bipartite graphs in general.
doi:10.1016/s0012-365x(02)00803-8 fatcat:rlvvp22rrrh4xoxmlh7zdrs5zu