Graph models for PLA folding problems

DOI10.1080/00207729508929110zbMATH Open0835.68086OpenAlexW2066186056MaRDI QIDQ4848447FDOQ4848447

Authors: Enrico Macii, Tara Wolf 

Publication date: 17 September 1995

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729508929110

Recommendations

• Graph theoretic analysis of PLA folding heuristics
• PLA folding in special graph classes
• scientific article; zbMATH DE number 4147519
• On the orderability problem for PLA folding
• On the folding of graphs-theory and application
• Structural and computational results on platypus graphs
• scientific article; zbMATH DE number 4149902
• Origami fold as algebraic graph rewriting
• scientific article; zbMATH DE number 6289085

zbMATH Keywords

programmable logic arraysblock folding problems

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation

Cited In (9)

• A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bipartite convolution of a programmable logic array.
• PLA folding in special graph classes
• Suboptimal solution for PLA multiple column folding
• On the orderability problem for PLA folding

This page was built for publication: Graph models for PLA folding problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4848447)