References
- Agasi , E. , Becker , R. I. and Perl , Y. 1982 . “ Research Report 010 ” . In A Shifting Algorithm for Constrained Min‐Max Partition of Trees , University of Cape Town . Department of Mathematics
- Aho , A. V. , Hopcroft , J. E. and Ullman , J. D. 1976 . The Design and Analysis of Computer Algorithms , Addison‐Wesley . Reading, Mass
- Becker , R. I. , Perl , Y. and Schach , S. R. 1982 . A shifting algorithm for min‐max tree partitioning . J. ACM , 29 : 58 – 67 .
- Becker , R. I. , Perl , Y. and Schach , S. R. 1982 . An efficient implementation of an algorithm for min‐max tree partitioning . Quaest. Informaticae , 2 : 27 – 30 .
- Becker , R. I. and Perl , Y. 1982 . Bottom‐up algorithms for tree partitioning with general weighting functions . 2 In preparation
- Farley , A. , Hedetniemi , S. and Proskurowski , A. 1981 . Partitioning trees: matching, domination and maximum diameter . Intern. J. Comp. Inf. Sci , 10 : 55 – 61 .
- Harary , F. 1969 . Graph Theory , Addison‐Wesley . Reading, Mass
- Kundu , S. and Misra , J. 1977 . SIAM J. Computing , 6 : 131 – 134 .
- Perl , Y. and Schach , S. R. 1981 . Schach, Max‐min tree‐partitioning . J. ACM , 28 : 5 – 15 .
- Perl , Y. and Snir , M. 1982 . “ Circuit partitioning with size and connection constraints ” . In Proc. Sixteenth Annual Conf. on Information Science and Systems , 80 – 84 . Princeton .
- Peri , Y. and Vishkin , U. 1982 . “ Junction tree structure with application to a shifting algorithm ” . In IBM Research Report RC 9405 , New York : Yorktown Heights .