An O(n) time algorithm for maximum matching in P4-tidy graphs

https://doi.org/10.1016/S0020-0190(97)00081-1Get rights and content

Abstract

The P4-tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with “few” induced P4 s. In this paper, we extend to P4-tidy graphs a linear time algorithm of C.-H. Yang and M.-S. Yu for finding a maximum matching in a cograph G (given a parse tree associated to G).

References (15)

There are more references available in the full text version of this article.

Cited by (0)

View full text