References
- Abrahamson , K. , Dadoun , N. , Kirkpatrick , D. G. and Przytycka , T. 1989 . A simple parallel tree contraction algorithm . Journal of Algorithms , 10 : 287 – 302 .
- Corneil , D. G. , Lerchs , H. and Stewart , L. 1981 . Complement reducible graphs . Journal Disc. Appl. Math. , 3 : 163 – 175 .
- Cole , R. and Vishkin , U. 1986 . Proc. 18th Annual Symposium on the Theory of Computing . Deterministic coin tossing and accelerated cascades: Micro and macro techniques for designing parallel algorithms . 1986 . pp. 206 – 219 .
- Cole , R. and Vishkin , U. 1988 . Approximate parallel scheduling. Part If: The basic technique with applications to optimal parallel list ranking in logarithmic time . SIAM Journal on Computing , 17 128 – 142 .
- Cole R. Vishkin U. The accelerated centroid decomposition technique for optimal tree evaluation in logarithmic time Department of Computer Science, Courant Institute 1986 Ultracomputer Note 108, TR-242 , NYU,
- Dadoun , N. and Kirkpatrick , D. G. 1987 . Proc. 3rd A CM Symposium on Computational Geometry . Parallel processing for efficient subdivision search . 1987 . pp. 205 – 214 .
- Gibbons , A. and Rytter , W. 1986 . Proc. Symposium on Foundations of Software Eng and Theoretical Comp. Sc . An optimal parallel algorithm for dynamic tree expression evaluation and its applications . 1986 . pp. 453 – 469 .
- He , X. and Yesha , Y. 1988 . Binary tree algebraic computation and Parallel algorithms for simple graphs . Journal of Algorithms , 9 92 – 113 .
- Jamison B. Olariu S. An optimal recognition algorithm for P4-reducible graphs Proc. 9-th Conferences on Foundations of Software Technology and Theoretical Computer Science Springer-Verlag Bangalore, India 1989 1 19 Lecture Notes in Computer Science
- Jamison , B. and Olariu , S. in press . A linear-time recognition algorithm for P4-sparse graphs . SIAM Journal of Computing ,
- Kruskal , C. P. , Rudolph , L. and Snir , M. 1990 . Efficient parallel algorithms for graph problems . Algorithmica , 5 43 – 64 .
- Lakshmivarahan , S. and Dhall , S. K. 1990 . “ Analysis and Design of Parallel Algorithms: Arithmetic and Matrix problems ” . McGraw-Hill .
- Miller , G. L. and Reif , J. 1985 . Proc. 17th Annual Symposium on the Theory of Computing . Parallel tree contraction and its applications . 1985 . pp. 478 – 489 .
- Schieber , B. and Vishkin , U. 1988 . On finding lowest common ancestors: simplification and parallelization . SIAM Journal on Computing , 17 1253 – 1262 .
- Tarjan , R. E. and Vishkin , U. 1985 . An efficient parallel biconnectivity algorithm . SIAM Journal on Computing , 14 862 – 874 .
- Vishkin U. Sparse matrix techniques. Copenhague Synchronous parallel computation—a survey Department of Computer Science, Courant Institute 1983 TR. 71 NYU