On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 5 (1), 117-126
- https://doi.org/10.1137/0405010
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Fast self-reduction algorithms for combinatorial problems of VLSI designPublished by Springer Nature ,2006
- 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
- Nonconstructive advances in polynomial-time complexityInformation Processing Letters, 1987
- Exact and Approximate Solutions for the Gate Matrix Layout ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted TreesSIAM Journal on Computing, 1985
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- Black-white pebbles and graph separationActa Informatica, 1981
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sindMathematische Nachrichten, 1972