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 also is in NC for bounded degree trees.
This research was supported by the ESPRIT BRA Program of the EC under contract no. 7141, project ALCOM II.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, N. Dadoun, D. Kirkpatrick, and K. Przytycka. A simple parallel tree contraction algorithm. Journal of Algorithms, 10:287–302, 1989.
D. Adolphson and T.C. Hu. Optimal linear ordering. SIAM J. on Applied Mathematics, 25(3):403–423, Nov 1973.
M. Chung, F. Makedon, I.H. Sudborough, and J. Turner. Polynomial time algorithms for the min cut problem on degree restricted trees. In FOCS, volume 23, pages 262–271, Chicago, Nov 1982.
J. Díaz. Graph layout problems. In I.M. Havel and V. Koubek, editors, Mathematical Foundations of Computer Science, volume 629, pages 14–24. Springer-Verlag, Lecture Notes in Computer Science, 1992.
S. Even and Y. Shiloach. NP-completeness of several arrangements problems. Technical report, TR-43 The Technical, Haifa, 1978.
F. Gavril. Some NP-complete problems on graphs. In Proc. 11th. Conf. on Information Sciences and Systems, pages 91–95, John Hopkins Univ., Baltimore, 1977.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to Oie Theory of NP-Completeness. Freeman, San Francisco, 1979.
L.H. Harper. Optimal numberings and isoperimetric problems on graphs. Journal of Combinatorial Theory, 1(3):385–393, 1966.
B. Monien and I.H. Sudborough. Min cut is NP-complete for edge weighted trees. In L. Kott, editor, Proc. 13th. Coll. on Automata, Languages and Programming, pages 265–274. Springer-Verlag, Lectures Notes in Computer Science, 1986.
M.T. Shing and T. C. Hu. Computational complexity of layout problems. In T. Ohtsuki, editor, Layout design and verification, pages 267–294, Amsterdam, 1986. North-Holland.
Yossi Shiloach. A minimum linear arrangement algorithm for undirected trees. SIAM J. on Computing, 8(1):15–31, February 1979.
Mihalis Yannakakis. A polynomial algorithm for the min cut linear arrangement of trees. In IEEE Symp. on Found. of Comp. Sci., volume 24, pages 274–281, Providence RI, Nov. 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Díaz, J., Gibbons, A., Pantziou, G., Serna, M., Spirakis, P., Toran, J. (1995). Efficient parallel algorithms for some tree layout problems. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030846
Download citation
DOI: https://doi.org/10.1007/BFb0030846
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive