Linear time algorithms for k-cutwidth problem
The Min Cut Linear Arrangement problem is to find a linear arrangement for a given graph such that the cutwidth is minimized. This problem has important applications in VLSI layout systems. It is known that this problem is NP-complete when the input is a general graph with maximum vertex degree at most 3. In this paper, we will first present a linear time algorithm to recognize the small cutwidth trees. The approach we used in this algorithm can then be easily extended to recognize the general graphs with cutwidth 3 in O(n) time.
Unable to display preview. Download preview PDF.
- C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam 1973.Google Scholar
- F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Reading, 1990.Google Scholar
- Fan R. K. Chung, “On the Cutwidth and the Topological Bandwidth of a Tree,” SIAM J. Alg. Disc. Meth., Vol. 6, No. 2, April 1985, pp. 268–277.Google Scholar
- M. J. Chung, F. Makedon, I. H. Sudborough and J. Tarner, ”Polynomial algorithm for the min-cut linear arrangement problem on degree restricted trees,” SIAM J. Comput., Vol. 14, No. 1, 1985, pp. 158–177.Google Scholar
- M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Franciso 1979.Google Scholar
- M. Y. Kao, ”All graphs have cycle separators and planar directed depth-first search is in DNC,” in Proc. 3rd Aegean Workship on Computing, Corfu, Greece, J. H. Reif, ed.; Lecture Notes in Computer Science 319, Springer-Verlay, Berlin, New York, 1988, pp. 53–63.Google Scholar
- Thomas Lengauer, ”Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees,” SIAM J. Alg. Disc. Meth., Vol. 3, No. 1, March 1982, pp. 99–113.Google Scholar
- A. D. Lopez, and H. F. S. Law, ”A Dense Gate Matrix Layout Method for MOS VLSI,” IEEE Trans. on Electronic Devices, ED-27, 8, 1980, pp. 1671–1675.Google Scholar
- F. S. Makedon, C. H. Papadimitriou and I. H. Sudborough, ”Topological Bandwidth,” SIAM J. Alg. Disc. Meth., Vol. 6, No. 3, July 1985, pp. 418–444.Google Scholar
- A. L. Rosenberg, ”The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors,” IEEE Trans. on Computers, Vol. C-32, No. 10, Oct. 1983, pp. 902–910.Google Scholar
- M. Yannakakis, ”A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees,” J. ACM., Vol. 32, No. 4, 1985, pp. 950–988.Google Scholar