Graph Problems Related to Gate Matrix Layout and PLA Folding
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- Nonconstructive advances in polynomial-time complexityInformation Processing Letters, 1987
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Exact and Approximate Solutions for the Gate Matrix Layout ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Distance-hereditary graphsJournal of Combinatorial Theory, Series B, 1986
- Bipartite Folding and Partitioning of a PLAIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984
- Decomposition of Directed GraphsSIAM Journal on Algebraic Discrete Methods, 1982
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976