Maximum Induced Matchings for Chordal Graphs in Linear Time
The Maximum Induced Matching ( MIM) Problem asks for a largest set of pairwise vertex- disjoint edges in a graph which are pairwise of distance at least two. It is well- known that the MIM problem is NP- complete even on particular bipartite graphs and on line graphs. On the other hand, it is solvable in polynomial time for various classes of graphs ( such as chordal, weakly chordal, interval, circular- arc graphs and others) since the MIM problem on graph G corresponds to the Maximum Independent Set problem on the square G* = L( G) 2 of the line graph L( G) of G, and in some cases, G* is in the same graph class; for example, for chordal graphs G, G* is chordal. The construction of G*, however, requires O( m2) time, where m is the number of edges in G. Is has been an open problem whether there is a linear- time algorithm for the MIM problem on chordal graphs. We give such an algorithm which is based on perfect elimination order and LexBFS.
maximum induced matchings chordal graphs perfect elimination order lexicographic breadth-first search linear time algorithm