Work

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

Year: 1982

Type: article

Abstract: An implementation of an algorithm for finding a min-max partition of a weighted tree T with n vertices into q subtrees \nby means of k = q-1 cuts is presented. The implementation is shown to have asymptotic complexity O(k3rd(T) + kn), \nwhere rd(T) is the number of edges in the radius of T.

Source: Unisa Institutional Repository (University of South Africa)

Authors: Ronald I. Becker, Yehoshua Perl, Stephen R. Schach

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2794140302

FWCI: 0.598

Cites:

Cited by: 2

Related to: 10