The Library
THE MINSUMCUT PROBLEM
Tools
UNSPECIFIED (1991) THE MINSUMCUT PROBLEM. LECTURE NOTES IN COMPUTER SCIENCE, 519 . pp. 65-79. ISSN 0302-9743.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
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 |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |