O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
- 31 March 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (1), 106-112
- https://doi.org/10.1016/0196-6774(87)90030-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- An Analysis of a Good Algorithm for the Subtree ProblemSIAM Journal on Computing, 1977
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973