A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs

The Min Cut Linear Arrangment ( Min Cut ) problem for hypergraphs was previously considered by Cahoon and Sahni [CS], where it was called the Board Permutation problem (BP). They gave O(n) and O(n3) algorithms for determining cutwidth 1 and 2, respectively, and cited the open problem: Is there is an algorithm that determines in O(nck) time if a hypergraph has cutwidth k? We describe an O(nm) algorithm, with m=k2+3K+3, which determines if a hypergraph has cutwidth k. The Min Cut or BP problem, where one wishes to minimize "backplane area" in automating circuit design, is the subject of several recent papers [CS2], [Y], [W], [L], [S], [GCT], [C], [GS].

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

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

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

[4]  Christos H. Papadimitriou,et al.  The Complexity of Searching a Graph (Preliminary Version) , 1981, FOCS.

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

[6]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[7]  Shigeki Goto,et al.  Suboptimum solution of the back-board ordering with channel capacity constraint , 1977 .

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

[9]  Sartaj Sahni,et al.  Heuristics for the Circuit Realization Problem , 1983, 20th Design Automation Conference Proceedings.

[10]  Jonathan S. Turner,et al.  GRAPH SEPARATION AND SEARCH NUMBER. , 1987 .

[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]  Fillia Makedon,et al.  Minimizing Width in Linear Layouts , 1983, ICALP.

[13]  Ivan Hal Sudborough,et al.  Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.

[14]  I. Cederbaum,et al.  Optimal backboard ordering through the shortest path algorithm , 1974 .