Fast RNC and NC Algorithms for Maximal Path Sets

[1]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[2]  Zhi-Zhong Chen.  Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings , 1996, Theor. Comput. Sci..

[3]  Zhi-Zhong Chen,et al.  A Fast and Efficient NC Algorithm for Maximal Matching , 1995, Inf. Process. Lett..

[4]  Zhi-Zhong Chen.  NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings , 1995, ICALP.

[5]  Clifford Stein,et al.  Long tours and short superstrings , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Wojciech Rytter,et al.  Parallel and Sequential Approximations of Shortest Superstrings , 1994, SWAT.

[7]  F. Frances Yao,et al.  Approximating shortest superstrings , 1997, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[8]  Tao Jiang,et al.  A Note on Shortest Superstrings with Flipping , 1992, Inf. Process. Lett..

[9]  Hillel Gazit,et al.  Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[10]  Tao Jiang,et al.  Linear approximation of shortest superstrings , 1991, STOC '91.

[11]  Jonathan S. Turner,et al.  Approximation Algorithms for the Shortest Common Superstring Problem , 1989, Inf. Comput..

[12]  Jeffrey D. Smith,et al.  Design and Analysis of Algorithms , 2009, Lecture Notes in Computer Science.

[13]  Alon Itai,et al.  A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..