Author:
Kao Ming-Yang,Teng Shang-Hua,Toyama K.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference39 articles.
1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple tree contraction algorithm,Journal of Algorithms, 10:287?302, 1989.
2. A. Aggarwal and R. J. Anderson, A random NC algorithm for depth-first seach,Combinatorica, 8:1?12, 1988.
3. A. Aggarwal, R. J. Anderson, and M. Y. Kao, Parallel depth-first search in general directed graphs,SIAM Journal on Computing, 19:397?409, 1990.
4. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
5. R. J. Anderson and G. L. Miller, Deterministic parallel list ranking,Algorithmica, 6:859?868, 1991.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献