An Analysis of a Good Algorithm for the Subtree Problem
- 1 December 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (4) , 730-732
- https://doi.org/10.1137/0206053
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- ChronicleSIAM Review, 1968