Subtree Isomorphism in O(n5/2)
Author:
- David W. MatulaDMDavid W. Matula
- 1 January 1978
- book chapter
- Published by Elsevier
- p. 91-106
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973