论文信息 - A Randomized NC Algorithm for the Maximal Tree Cover Problem - 字舞流文

A Randomized NC Algorithm for the Maximal Tree Cover Problem

Zhi-Zhong Chen | Zhi-Zhong Chen | Zhi-Zhong Chen

[1] Vijay V. Vazirani,et al. A Fast Parallel Algorithm for Finding a Maximal Bipartite Set , 1990, FSTTCS.

[2] Satoru Miyano,et al. Bounded Degree Maximal Subgraph Problems are in NC , 1990 .

[3] A. Aggarwal,et al. Parallel depth-first search in general directed graphs , 1989, STOC '89.

[4] Gary L. Miller,et al. An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph , 1988, Information Processing Letters.

[5] Amos Israeli,et al. An Improved Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[6] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[7] Richard Anderson. A parallel algorithm for the maximal path problem , 1985, STOC '85.

[8] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[9] Richard M. Karp,et al. A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.

[10] S. N. Maheshwari,et al. Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems , 1982, Inf. Process. Lett..