Elsevier

Integration

Volume 12, Issue 3, December 1991, Pages 321-337
Integration

Fast search algorithms for layout permutation problems

https://doi.org/10.1016/0167-9260(91)90028-JGet rights and content

Abstract

We have previously established the existence of decision algorithms with low-degree polynomial running times for a number of difficult combinatorial problems, including many that can be stated in terms of VLSI layout, placement, embedding and routing. In this paper, we turn our attention to the search complexity of these problems. We introduce a general technique, which we term scaffolding, and illustrate how it is useful in the design of efficient search algorithms.

References (26)

  • N. Robertson et al.

    Graph minors V. Excluding a planar graph

    J. Comb. Th. Ser.

    (1986)
  • M.R. Fellows et al.

    Nonconstructive advances in polynomial-time complexity

  • N. Robertson et al.

    Disjoint paths—a survey

    SIAM J. Algebraic and Discrete Methods

    (1985)
  • N. Robertson et al.

    Graph minors—a survey

  • N. Robertson and P.D. Seymour, Graph minors IV. Tree-width and well-quasi-ordering, J. Comb. Th. Ser. B, to...
  • N. Robertson and P.D. Seymour, Graph minors X. Obstructions to tree-decomposition, to...
  • N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problem, to...
  • N. Robertson and P.D. Seymour, Graph minors XVI. Wagner's conjecture, to...
  • M.R. Fellows et al.

    Nonconstructive tools for proving lynomial-time decidability

    J. ACM

    (1988)
  • M.R. Fellows et al.

    Layout permutation problems and well-partially-ordered sets

  • M.R. Fellows and M.A. Langston, On well-partial-order theory and its application to combinatorial problems of VLSI...
  • M.R. Garey et al.

    Computers and Intractability: A Guide to the Theory of NP-Completeness

    (1979)
  • D.J. Brown et al.

    Polynomial-time self-reducibility: theoretical motivations and practical results

    Int. J. of Comp. Math.

    (1989)
  • Cited by (0)

    A preliminary version of a portion of this paper was presented at the Third Aegean Workshop on Computing (AWOC) held on Corfu Island, Greece, in June, 1988.

    1

    A portion of this author's work was performed while visiting the Institute for Mathematics and its Applications at the University of Minnesota, Minneapolis, MN, and while visiting the Coordinated Science Laboratory at the University of Illinois, Urbana, IL, USA.

    View full text