Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
68.753 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Efficient parallel algorithms for some tree layout problems

Thumbnail
View/Open
1400014108.pdf (675,7Kb)
  View UPCommons Usage Statistics
  LA Referencia / Recolecta stats
Includes usage data since 2022
Cita com:
hdl:2117/370809

Show full item record
Díaz Cort, JosepMés informacióMés informacióMés informació
Gibbons, Alan M.
Pantziou, Grammati
Serna Iglesias, María JoséMés informacióMés informacióMés informació
Spirakis, Paul George
Torán Romero, Jacobo
Document typeResearch report
Defense date1992
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 4.0 International
This work is protected by the corresponding intellectual and industrial property rights. Except where otherwise noted, its contents are licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 4.0 International
Abstract
The minimum cut and minimum sum linear arrangement problems usually occur in solving wiring problems and have a lot in common with job sequencing questions. Both problems are NP-complete for general graphs and P for trees. We show in this paper that both problems are NC for trees.
CitationDiaz, J. [et al.]. Efficient parallel algorithms for some tree layout problems. 1992. 
Is part ofLSI-92-33-R
URIhttp://hdl.handle.net/2117/370809
Collections
  • ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals - Reports de recerca [140]
  • Departament de Ciències de la Computació - Reports de recerca [1.109]
  View UPCommons Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
1400014108.pdf675,7KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina