Y. Boykov, O. Veksler, and R. Zabih, Fast approximate energy minimization via graph cuts, IEEE Transactions, 2001.
DOI : 10.1109/iccv.1999.791245
URL : http://www.csd.uwo.ca/~yuri/Papers/iccv99.pdf

A. Frank, On the edge-connectivity algorithm of Nagamochi and Ibaraki, 1994.

S. Fujishige, Submodular functions and optimization, 2005.

M. Goemans and V. Ramakrishnan, Minimizing submodular functions over families of sets, Combinatorica, vol.15, issue.4, pp.499-513, 1995.
DOI : 10.1007/978-3-642-97881-4

R. Gomory and T. Hu, Multi-Terminal Network Flows, Journal of the Society for Industrial and Applied Mathematics, vol.9, issue.4, pp.551-70, 1961.
DOI : 10.1137/0109047

M. Grtschel, L. Lovsz, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, vol.2, issue.2, pp.169-97, 1981.
DOI : 10.1016/0012-365X(80)90057-6

S. Iwata, L. Fleischer, and S. Fujishige, A combinatorial strongly polynomial algorithm for minimizing submodular functions, Journal of the ACM, vol.48, issue.4, pp.761-77, 2001.
DOI : 10.1145/502090.502096
URL : http://www.osaka-u.ac.jp/eng/research/annualreport/vol2/selection/pdf/paper04a.pdf

P. Kohli, M. Kumar, and P. Torr, P?? & Beyond: Move Making Algorithms for Solving Higher Order Functions, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.9, pp.1645-56, 2009.
DOI : 10.1109/TPAMI.2008.217

P. Kohli and P. Torr, Dynamic graph cuts and their applications in computer vision. InComputer Vision, pp.51-108, 2010.
DOI : 10.1007/978-3-642-12848-6_3
URL : http://research.microsoft.com/en-us/um/people/pkohli/papers/kt_BC2010.pdf

Y. Lee, A. Sidford, and S. Wong, A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp.1049-1065, 2015.
DOI : 10.1109/FOCS.2015.68
URL : http://arxiv.org/pdf/1508.04874

H. Lin and J. Bilmes, An application of the submodular principal partition to training data subset selection. InNIPS workshop on Discrete Optimization in Machine Learning, 2010.

H. Lin and J. Bilmes, Optimal Selection of Limited Vocabulary Speech Corpora, INTERSPEECH 2011 Aug, pp.1489-1492

L. Lovsz, M. Grtschel, and A. Schrijver, Geometric algorithms and combinatorial optimization, p.34, 1988.

H. Nagamochi and T. Ibaraki, Algorithmic aspects of graph connectivity, 2008.
DOI : 10.1017/CBO9780511721649

H. Nagamochi and T. Ibaraki, Computing Edge-Connectivity in Multigraphs and Capacitated Graphs, SIAM Journal on Discrete Mathematics, vol.5, issue.1, pp.54-66, 1992.
DOI : 10.1137/0405004

J. Orlin, A faster strongly polynomial time algorithm for submodular function minimization, InInternational Conference on Integer Programming and Combinatorial Optimization, pp.240-251, 2007.
DOI : 10.1007/978-3-540-72792-7_19

M. Queyranne, Minimizing symmetric submodular functions Mathematical Programming, pp.3-12, 1998.
DOI : 10.1007/bf01585863

A. Schrijver, A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time, Journal of Combinatorial Theory, Series B, vol.80, issue.2, pp.346-55, 2000.
DOI : 10.1006/jctb.2000.1989

M. Stoer and F. Wagner, A simple min-cut algorithm, Journal of the ACM, vol.44, issue.4, pp.585-91, 1997.
DOI : 10.1145/263867.263872

P. Wan, G. Clinescu, X. Li, and O. Frieder, Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks, pp.607-624, 2002.