M. Grübsch and O. David, How to divide a catchment to conquer its parallel processing. An efficient algorithm for the partitioning of water catchments, Mathematical and Computer Modelling, vol.33, issue.6-7, pp.723-731, 2001.
DOI : 10.1016/S0895-7177(00)00275-2

H. Wang, A common parallel computing framework for modeling hydrological processes of river basins, Parallel Computing, vol.37, issue.6-7, pp.302-315, 2011.
DOI : 10.1016/j.parco.2011.05.003

S. Yalew, Distributed computation of large scale SWAT models on the Grid, Environmental Modelling & Software, vol.41, pp.223-230, 2013.
DOI : 10.1016/j.envsoft.2012.08.002

R. Denzer, P. Fitch, I. N. Athanasiadis, and D. P. Ames, Parallel simulation of environmental phenomena, International Congress on Environmental Modelling and Software, pp.978-88, 2014.

T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman et al., An efficient k-means clustering algorithm: analysis and implementation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.24, issue.7, pp.881-892, 2002.
DOI : 10.1109/TPAMI.2002.1017616

A. D. King, Graph Clustering with Restricted Neighbourhood Search, Thesis, 2004.

A. Y. Ng, M. I. Jordan, and Y. Weiss, On spectral clustering: analysis and an algorithm