Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

THE MINSUMCUT PROBLEM

Tools
- Tools
+ Tools

UNSPECIFIED (1991) THE MINSUMCUT PROBLEM. LECTURE NOTES IN COMPUTER SCIENCE, 519 . pp. 65-79.

Research output not available from this repository, contact author.

Request Changes to record.

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:
DateEvent
1991UNSPECIFIED
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 View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us