An Efficient Implementation of an Algorithm for Min-Max Tree Partitioning

dc.contributor.author	Becker, Ronald I
dc.contributor.author	Perl, Yehoshua
dc.contributor.author	Schach, Stephen R.
dc.date.accessioned	2018-05-22T13:24:16Z
dc.date.available	2018-05-22T13:24:16Z
dc.date.issued	1982
dc.identifier.citation	Quaestiones Informaticae Vol 2 No 1 1982	en
dc.identifier.issn	0254-2757
dc.identifier.uri	http://hdl.handle.net/10500/24004
dc.description.abstract	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 O(k3rd(T) + kn), where rd(T) is the number of edges in the radius of T.	en
dc.language.iso	en	en
dc.publisher	Computer Society of South Africa (on behalf of SAICSIT)	en
dc.title	An Efficient Implementation of an Algorithm for Min-Max Tree Partitioning	en
dc.type	Article	en
dc.description.department	School of Computing	en