Randomized trial presents a polynomial algorithm minimizing edge weights in graph partitions, suggesting efficiency improvements.
The k-cut problem is to find a partition of an edge weighted graph into k nonempty components, such that the total edge weight between components is minimum. This problem is NP-complete for arbitrary k and its version involving fixing a vertex in each component is NP hard even for k=3. A polynomial algorithm for the case of a fixed k is presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Goldschmidt et al. (1988) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: