Name
Abstract | ||
|---|---|---|
In this paper we first present a sequential linear algorithm for a linear arrangement problem on trees, MINSUMCUT, and then an O(log n)-time parallel algorithm for MINSUMCUT on trees, which uses n2/(log n) processors. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/BFb0028251 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | Field | DocType |
parallel algorithm | Binary logarithm,Discrete mathematics,Outerplanar graph,Combinatorics,Parallel algorithm,Computer science,Linear algorithm,Sequential algorithm,Criss-cross algorithm | Conference |
Volume | ISSN | Citations |
519 | 0302-9743 | 12 |
PageRank | References | Authors |
0.81 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Josep Díaz | 1 | 20 | 1.80 |
| Alan Gibbons | 2 | 117 | 17.52 |
| Mike Paterson | 3 | 744 | 152.22 |
| Jacobo Torán | 4 | 564 | 49.26 |