The Matching Problem for Strongly Chordal Graphs is in $NC$

Fast parallel algorithms for chordal graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Randomness-optimal unique element isolation, with applications to perfect matching and related problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)

The matching problem for bipartite graphs with polynomially bounded permanents is in NC

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

The polynomially bounded perfect matching problem is in NC2

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science