Linear time maximum induced matching algorithm for trees
Michele Zito · 2000
A matching in a graph G is a collection of non-intersecting edges. The matching is induced if no two edges in the matching are joined by an edge in G. This paper studies the complexity of nding a largest induced matching when the input graph is a tree. We describe the rst linear time algorithm for this problem.