论文信息 - Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems

Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems

Abstract 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 is in NC for bounded degree trees. To the best of our knowledge, these are the first parallel algorithms for the minimum length and the minimum cut linear arrangement problems.

[1] David G. Kirkpatrick,et al. A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.

[2] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[3] D. Adolphson. Optimal linear-ordering. , 1973 .

[4] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5] Josep Díaz. Graph Layout Problems , 1992, MFCS.

[6] Yossi Shiloach,et al. A Minimum Linear Arrangement Algorithm for Undirected Trees , 1979, SIAM J. Comput..

[7] L. H. Harper. Optimal numberings and isoperimetric problems on graphs , 1966 .

[8] Ivan Hal Sudborough,et al. Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.

[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10] Mihalis Yannakakis,et al. A polynomial algorithm for the MIN CUT linear arrangement of trees , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11] T. Ohtsuki,et al. Layout design and verification , 1986 .

[12] Fillia Makedon,et al. Polynomial time algorithms for the MIN CUT problem on degree restricted trees , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).