Fast search algorithms for layout permutation problems
- 31 December 1991
- journal article
- Published by Elsevier in Integration
- Vol. 12 (3) , 321-337
- https://doi.org/10.1016/0167-9260(91)90028-j
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Minimizing width in linear layoutsPublished by Springer Nature ,2005
- Graph minors. IV. Tree-width and well-quasi-orderingJournal of Combinatorial Theory, Series B, 1990
- Polynomial-time self-reducibility: theoretical motivations and practical results∗International Journal of Computer Mathematics, 1989
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- Exact and Approximate Solutions for the Gate Matrix Layout ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Searching and pebblingTheoretical Computer Science, 1986
- Disjoint Paths—A SurveySIAM Journal on Algebraic Discrete Methods, 1985
- Black-white pebbles and graph separationActa Informatica, 1981
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sindMathematische Nachrichten, 1972