Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Paper
On the k-cut problem
Abstract
Given a graph with nonnegative edge-weights, let f(k) be the value of an optimal solution of the k-cut problem. We study f as a function of k. Let g be the convex envelope of f. We give a polynomial algorithm to compute g. In particular, if f is convex, then it can be computed in polynomial time for all k. We show some experiments in computing g.
Related
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
Conference paper
Convergence properties of multi-dimensional stack filters
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990