An O(n) time algorithm for maximum matching in P4-tidy graphs
References (15)
- et al.
A tree representation for P4-sparse graphs
Discrete Appl. Math.
(1992) - et al.
On a unique tree representation for P4-extendible graphs
Discrete Appl. Math.
(1991) - et al.
An optimal parallel matching algorithm for cographs
J. Parallel Distrib. Comput.
(1994) Two theorems in graph theory
- et al.
Graph Theory with Applications
(1979) - et al.
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
(1993) - et al.
A new linear time algorithm for modular decomposition
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1997 Published by Elsevier B.V.