How to divide a catchment to conquer its parallel processing. An efficient algorithm for the partitioning of water catchments

Mathematical and Computer Modelling

Volumn 33, Issue 6-7, 2001, Pages 723-731

  Grubsch M ^a   David, O ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Graph theory; Parallel processing; Water catchments

Indexed keywords

EID: 0035107676     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(00)00275-2     Document Type: Article

References (12)

1. Watershed modelling
2. Entwicklung und Evaluìerung von Netzwerktopologìen für homogene hydrologische Modelleinheiten durch GIS-Methoden
3. Some simplified NP-complete graph problems
4. A multilevel algorithm for partitioning graphs
5. An improved spectral graph partitioning algorithm for mapping parallel computations
6. Effective graph clustering for path queries in digital map databases
7. An efficient heuristic procedure for partitioning graphs
8. A collection of graph partitioning algorithms: Simulated annealing, simulated tempering, Kernighan Lin, two optional, graph reduction, bisection