R. Bellman, A note on cluster analysis and dynamic programming, Mathematical Biosciences, vol.18, issue.3-4, pp.311-312, 1973.
DOI : 10.1016/0025-5564(73)90007-2

V. Kolmogorov and R. Zabih, What energy functions can be minimized via graph cuts?, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.2, pp.147-159, 2004.
DOI : 10.1109/TPAMI.2004.1262177
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1823

J. Picard and H. D. Ratliff, Minimum cuts and related problems, Networks, vol.17, issue.4, pp.357-370, 1975.
DOI : 10.1002/net.3230050405

H. Wang and M. Song, Ckmeans.1d.dp: optimal k-means clustering in one dimension by dynamic programming, The R Journal, vol.3, issue.2, pp.29-33, 2011.