Author:
Kao Ming-Yang,Lam Tak-Wah,Sung Wing-Kin,Ting Hing-Fung
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. R. K. Ahuja, J. B. Orlin, C. Stein, and R. E. Tarjan. Improved algorithms for bipartite network flow. SIAM Journal on Computing, 23(5):906–933, 1994.
2. M. J. Chung. O(n 2.5) time algorithms for the subgraph homeomorphism problem on trees. Journal of Algorithms, 8:106–112, 1987.
3. R. Cole, M. Farach, R. Hariharan, T. M. Przytycka, and M. Thorup. An O(n log n) time algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing. To appear.
4. T. H. Cormen, C. L. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1991.
5. Lect Notes Comput Sci;M. Farach,1995