Name
Abstract | ||
|---|---|---|
Algorithms with a divide-and-conquer structure are suitable candidates for parallelization. The idea of the divide-and-conquer paradigm is to fragment a problem into subproblems of the same kind, to solve the subproblems recursively, and, finally, to combine the solutions of the subproblems into a solution of the original problem. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1007/3-540-55027-5_7 | Parallelism, Learning, Evolution |
Keywords | Field | DocType |
par- allel algorithm,divide-and-conquer,microtasking,convex hull.,multitasking,divide-and-conquer algorithms,macrotasking,cray x-mp,euclidean traveling salesman problem,divide and conquer,convex hull,traveling salesman problem | Bottleneck traveling salesman problem,Euclidean traveling salesman problem,Parallel algorithm,Convex hull,Theoretical computer science,2-opt,Divide and conquer algorithms,Human multitasking,Recursion,Mathematics | Conference |
Volume | ISSN | ISBN |
565 | 0302-9743 | 3-540-55027-5 |
Citations | PageRank | References |
1 | 0.38 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Renate Knecht | 1 | 21 | 2.78 |