Fast search algorithms for layout permutation problems☆
References (26)
- et al.
Graph minors V. Excluding a planar graph
J. Comb. Th. Ser.
(1986) - et al.
Nonconstructive advances in polynomial-time complexity
- et al.
Disjoint paths—a survey
SIAM J. Algebraic and Discrete Methods
(1985) - 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...
- et al.
Nonconstructive tools for proving lynomial-time decidability
J. ACM
(1988) - et al.
Layout permutation problems and well-partially-ordered sets
Computers and Intractability: A Guide to the Theory of NP-Completeness
(1979)
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.
Copyright © 1991 Published by Elsevier B.V.