How to divide a catchment to conquer its parallel processing. An efficient algorithm for the partitioning of water catchments (Q5939088): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127173941, #quickstatements; #temporary_batch_1723982401803 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127173941 / rank | |||
Normal rank | |||
Latest revision as of 13:12, 18 August 2024
scientific article; zbMATH DE number 1625126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to divide a catchment to conquer its parallel processing. An efficient algorithm for the partitioning of water catchments |
scientific article; zbMATH DE number 1625126 |
Statements
How to divide a catchment to conquer its parallel processing. An efficient algorithm for the partitioning of water catchments (English)
0 references
14 May 2002
0 references
water catchments
0 references
parallel processing
0 references
graph theory
0 references
