Efficient parallel algorithms for some tree layout problems
View/Open
Cita com:
hdl:2117/370809
Document typeResearch report
Defense date1992
Rights accessOpen Access
Except where otherwise noted, content on this work
is 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
Files | Description | Size | Format | View |
---|---|---|---|---|
1400014108.pdf | 675,7Kb | View/Open |