Subtree isomorphism is NC reducible to bipartite perfect matching
A simple NC reduction of the problem of subtree isomorphism to that of bipartite perfect matching is presented. The reduction implies the membership of the subtree isomorphism problem in random \(NC^ 3\).
scientific article; zbMATH DE number 4087045