A polynomial algorithm for the min-cut linear arrangement of trees

Journal of the ACM (JACM)

Volumn 32, Issue 4, 1985, Pages 950-988

  Yannakakis, Mihalis ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Cutwidth; min cut linear arrangement; pebbling

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

MIN-CUT LINEAR ARRANGEMENT; PEBBLING; POLYNOMIAL ALGORITHM;

MATHEMATICAL TECHNIQUES;

EID: 0022146832     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/4221.4228     Document Type: Article

References (27)

1. Brent, R.P., and Kung, H.T. On the area of binary tree layouts. Inf. Proc. Lett. 11 (1980), 44-46.
2. Chung, F. R. K. Some problems and results in labelings of graphs. In The Theory and Applications of Graphs, G. Chartrand, ed. Wiley, New York, 1981, pp. 255-263.
3. Chung, F. R. K. On the cutwidth and the topological bandwidth of a tree. SIAM J. Alg. Disc. Meth., to appear.
4. Chung, F.R.K. On optimal linear arrangements of trees. Comput. Math. Applic. 10 (1984), 43-60.
5. Chung, M., Makedon, F., Sudborough, I.H., and Turner, J. Polynomial tile algorithms for the min cut problem on degree restricted trees. In Proceedings of the 23rd Annual Symposium on the Foundations of Computer Science. IEEE, New York, 1982, pp. 262-271.
6. Cook, S. A., and Sethi, R. Storage requirements for deterministic polynomial finite recognizable languages. J. Comput. Syst. Sci. J(1976), 25-37.
7. Dolev, D., and Trickey, H. Embedding a tree on a line. IBM tech. rep. RJ3368, IBM, San Jose, Calif., 1982.
8. Feller, A. Automatic layout of low-cost quick turnaround random-logic custom LSI devices. In Proceedings of the 13th Annual Design Automation Conference. IEEE, New York, 1976, pp. 79-85.
9. Fisher, M.J., and Paterson, M. Optimal tree layout. In Proceedings of the 12th Annual ACM Symposium on the Theory of Computing (Los Angeles, Calif., Apr. 28-30), ACM, New York, 1980, pp. 177-189.
10. Foster, M.J., and Kung, H.T. Recognizing regular languages with programmable building blocks. In VLSI-81, J. P. Gray, ed. Academic Press, Orlando, Fla., 1981, pp. 75-84.
11. Garey, M.R., and Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, Calif., 1979.
12. Garey, M.R., Graham, R.L., Johnson, D.S., andKnuth, D. Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34 (1978), 477-495.
13. Gavril, F. Some NP-complete problems on graphs. In Proceedings of the 11th Conference on Information Sciences and Systems. Johns Hopkins University, Baltimore, Md., 1977, pp. 91-95.
14. Gilbert, J.R., Lengauer, T., and Tarjan, R.E. The pebbling problem is complete in polynomial space. SIAM J. Comput. 9, 3 (1980), 513-525.
15. Golberg, M., and Klipker, I. An algorithm of a minimal placing of a tree on the line. Sakharth. SSR Mech. Acad. Moambe 83 (1976), 553-556.
16. Leiserson, C. E. Area-efficient graph layouts (for VLSI). In Proceedings of the 21st Annual Symposium on Foundations of Computer Science. IEEE, New York, 1980, pp. 270-281.
17. Lengauer, T. Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees. SIAM J. Alg. Disc. Meth. 3 (1982), 99-113.
18. Lengauer, T. Black-white pebbles and graph separation. AT&T Bell Laboratory Memorandum. AT&T Bell Laboratories, Murray Hill, N.J.
19. Lengauer, T., and Tarjan, R. E. The space complexity of pebble games on trees. Inf. Proc. Lett. 70(1980), 184-188.
20. Loui, M.C. The space complexity of two pebble games on trees. LCS rep. No. 133, M.I.T., Cambridge, Mass., 1979.
21. Makedon, F., and Sudborough, I. H. Minimizing width in linear layouts. In Proceedings of the 10th International Colloquium on Automata, Languages, and Programming. Springer Verlag, New York, 1983, pp. 478-490.
22. Makedon, F., Papadimitriou, C. H., and Sudborough, I.H. Topological bandwidth. SIAM J. Alg. Disc. Meth. to appear.
23. Meggido, N., Hakimi, S. L., Garey, M. R., Johnson, D. S., Papadimitriou, C. H. The complexity of searching a graph. In Proceedings of the 12th Annual Symposium on Foundations of Computer Science. IEEE, New York, 1981, pp. 376-385.
24. Meyer auf der Heide, F. A comparison between two variations of a pebble game on graphs. Theor. Comput. Sci, 13 (1981), 315-322.
25. Persky, G., Deutsch, D., and Schweikert, D. LTX-A minicomputer-based system for automated LSI layout. J. Des. Autom. Fault Tolerant Comput. 1 (1977) 217-255.
26. Shiloach, Y. A minimum linear arrangement algorithm for undirected trees. SIAM J. Comput. 8 (1979), 15-32.
27. Valiant, L. G. Universality considerations in VLSI circuits. IEEE Trans. Comput. C-30, 2 (1981), 135-140.