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.

[1]  Thomas Lengauer.  Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees , 1982 .

[2]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Eitan M. Gurari,et al.  Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem , 1984, J. Algorithms.

[4]  E. Kuh,et al.  One-dimensional logic gate assignment and interval graphs , 1979, COMPSAC.

[5]  Arnold L. Rosenberg,et al.  The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors , 1983, IEEE Transactions on Computers.

[6]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

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

[8]  Fan Chung,et al.  ON THE CUTWIDTH AND THE TOPOLOGICAL BANDWIDTH OF A TREE , 1985 .

[9]  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).

[10]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[11]  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).

[12]  A.D. Lopez,et al.  A Dense Gate Matrix Layout Method for MOS VLSI , 1980, IEEE Journal of Solid-State Circuits.

[13]  Ming-Yang Kao,et al.  All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC , 1988, AWOC.

[14]  Ming-Yang Kao,et al.  Parallel Depth-First Search in General Directed Graphs , 1990, SIAM J. Comput..

[15]  Fillia Makedon,et al.  Topological Bandwidth , 1983, CAAP.

[16]  Frank Harary,et al.  Distance in graphs , 1990 .

[17]  S. Mitchell.  Linear algorithms to recognize outerplanar and maximal outerplanar graphs , 1979 .