Abstract
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 VLS1 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.
Cite
CITATION STYLE
Chen, M. liwa, & Lee, S. L. (1992). Linear time algorithms for k-cutwidth problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 650 LNCS, pp. 21–30). Springer Verlag. https://doi.org/10.1007/3-540-56279-6_54
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
