Becker, Ronald I; Perl, Yehoshua; Schach, Stephen R.
(Computer Society of South Africa (on behalf of SAICSIT), 1982)
An implementation of an algorithm for finding a min-max partition of a weighted tree T with n vertices into q subtrees
by means of k = q-1 cuts is presented. The implementation is shown to have asymptotic complexity ...