Show simple item record

dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorGibbons, Alan M.
dc.contributor.authorPaterson, Michael Stewart
dc.contributor.authorTorán Romero, Jacobo
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2020-09-07T14:43:09Z
dc.date.available2020-09-07T14:43:09Z
dc.date.issued1991-01
dc.identifier.citationDiaz, J. [et al.]. The MINSUMCUT problem. 1991.
dc.identifier.urihttp://hdl.handle.net/2117/328493
dc.description.abstractIn this paper we first present a sequential linear algorithm for an linear arrangement problem on trees, the MINSUMCUT, and then a 0(log n) time parallel algorithm for the MINSUMCUT on trees, which uses n [super 2]/(log n) processors.
dc.format.extent16 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-91-11
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshParallel algorithms
dc.titleThe MINSUMCUT problem
dc.typeExternal research report
dc.subject.lemacAlgorismes paral·lels
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac515017
dc.description.versionPostprint (published version)
local.citation.authorDiaz, J.; Gibbons, A.; Paterson, M.; Toran, J.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain