Efficient Parallel Algorithms For Some Tree Layout Problems
Computer Science, Theory & Methods
The minimum cut and minimum length 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 in P for trees. We present here two parallel algorithms for the CREW PRAM. The first solves the minimum length linear arrangement problem for trees and the second solves the minimum cut arrangement for trees. We prove that the first problem belongs to NC for trees, and the second problem also is in NC for bounded degree trees.
Computing and Combinatorics
"Efficient Parallel Algorithms For Some Tree Layout Problems" (1995). Faculty Bibliography 1990s. 2920.