A polynomial algorithm for recognizing small cutwidth in hypergraphs

  • Z. Miller
  • I. H. Sudborough
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 227)


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].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ch]
    F. R. K. Chung, "On the Cutwidth and the Topological Bandwidth of a Tree", SIAM J. Alg. Discrete Meth. (1985).Google Scholar
  2. [C]
    I. Cederbaum, "Optimal Backboard Ordering through the Shortest Path Algorithm", IEEE Trans. on Circuits and Systems 21,5 (1974), pp. 626–632.Google Scholar
  3. [CS]
    J. Cahoon and S. Sahni, "Two Algorithms for Special Cases of the Board Permutation Problem", manuscriptGoogle Scholar
  4. [CS2]
    J. Cahoon and S. Sahni, "Heuristics for the Board Permutation Problem", IEEE Int. Conf. on Computer-Aided Design ( 1983 ), pp. 81–83.Google Scholar
  5. [CMSTzzz]
    M.-J. Chung, F. Makedon, I. H. Sudborough and J. Turner, "Polynomial Algorithms for the Min-Cut Linear Arrangement Problem on Degree Restricted Trees", SIAM J. Computing 14, 1 (1985), pp. 158–177.Google Scholar
  6. [ESTzzz]
    J.A. Ellis, I.H. Subdorough, and J.S. Turner, "Graph Separation and Search Number", manuscript, extended abstract in Proc. 1983 Allerton Conf. on Communication, Control, and Computing Google Scholar
  7. [GJ]
    Garey, M. R and Johnson, D. S, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco (1979)Google Scholar
  8. [GCT]
    S. Goto, I. Cederbaum, and B. S. Ting, "Suboptimum Solution of the Backboard Ordering Problem with Channel Capacity Constraint", IEEE Trans. on Circuits and Systems 21, 11 (1977), pp. 645–652.Google Scholar
  9. [GS]
    E. Gurari and I. H. Sudborough, "Improved Dynamic Programming Algorithms for Bandwidth Minimization and the Min Cut Linear Arrangment Problem", J. Algorithms 5 ( 1984 ), pp. 531–546.Google Scholar
  10. [L]
    J. T. Li, "Algorithms for Gate Matrix Layout", Proc. IEEE Int. Symp. on Circuits and Systems ( 1983 ), pp. 1013–1016.Google Scholar
  11. [MS]
    F. Makedon and I. H. Sudborough, "Minimizing Width in Linear Layouts", Proc. 10th ICALP, vol. 154, Lecture Notes in Computer Science, Springer Verlag ( 1983 ), pp. 478–490.Google Scholar
  12. [MPS]
    F. Makedon, C. H. Papadimitriou and I. H. Sudborough, "Topological Bandwidth", SIAM J. Alg. Discrete Meth. 6, 3 (1985), pp. 418–444.Google Scholar
  13. [MHGJP]
    N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson and C. H. Papadimitriou, "The Complexity of Searching a Graph (Preliminary Version)", Proc. IEEE FOCS (1981), pp. 376–385Google Scholar
  14. [M]
    Z. Miller, "A Linear Algorithm for Topological Bandwidth in Degree 3 Trees", manuscript.Google Scholar
  15. [MoS]
    B. Monien and I. H. Sudborough, "Min Cut is NP-Complete for Edge Weighted Trees", Proc. ICALP '86, to appear.Google Scholar
  16. [S]
    L. Steinberg, "The Back Board Wiring Problem: A Placement Algorithm", SIAM Review 3, 1 ( Jan. 1961 ), pp. 37–50.Google Scholar
  17. [SS]
    A. Sangiovanni-Vincentelli and M. Santomauro, "A Heuristic Guided Algorithm for Optimal Backboard Wiring", 13th Annual Allerton Conference on Circuits and Systems ( 1975 ).Google Scholar
  18. [Y]
    M. Yannakakis, ‘A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees", J. ACM 32, 4 ( 1985 ), pp. 950–959.Google Scholar
  19. [W]
    O. Wing, "Automated Gate Matrix Layout", Proc. IEEE 1982 Symp. on Circuits and Systems ( 1982 ), pp. 681–685.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Z. Miller
    • 1
  • I. H. Sudborough
    • 1
  1. 1.Department of Computer ScienceUniversity of Texas at DallasRichardson

Personalised recommendations