The Library
THE MINSUMCUT PROBLEM
Tools
Tools
Tools
UNSPECIFIED. (1991) THE MINSUMCUT PROBLEM. LECTURE NOTES IN COMPUTER SCIENCE, 519 . pp. 65-79. ISSN 0302-9743
Full text not available from this repository.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.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
| Journal or Publication Title: | LECTURE NOTES IN COMPUTER SCIENCE | ||||
| Publisher: | SPRINGER VERLAG | ||||
| ISSN: | 0302-9743 | ||||
| Official Date: | 1991 | ||||
| Dates: |
|
||||
| Volume: | 519 | ||||
| Number of Pages: | 15 | ||||
| Page Range: | pp. 65-79 | ||||
| Publication Status: | Published | ||||
| URI: | http://wrap.warwick.ac.uk/id/eprint/22481 |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Actions (login required)
 |
View Item |
