Graph theoretic analysis of PLA folding heuristics

DOI10.1016/0022-0000(93)90007-JzbMath0771.68092OpenAlexW1971751682MaRDI QIDQ2366688

S. S. Ravi, Errol L. Lloyd

Publication date: 18 August 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(93)90007-j

zbMATH Keywords

intersection graphsPLA implementations of combinatorial logicPLA-folding heuristics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Parallel concepts in graph theory
• On the orderability problem for PLA folding
• The Complexity of Near-Optimal Programmable Logic Array Folding
• A Separator Theorem for Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item