1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. Berger, M. J., and Bokhari, S. H. 1987. A partitioning strategy for nonuniform problems on multiprocessors. IEEE Transactions on Computers, C-36(5):570?580.
3. Cook, S. A. 1985. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2?22.
4. Dornhoff, L. L., and Hohn, F. E. 1978. Applied Mordern Algebra. Macmillan, New York.
5. Huang, M. -D. 1985. Solving graph problems with optimal speedup on mesh-of-tree networks. In Proc. Twenty-sixth Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, pp. 232?240.