Graph folding and programmable logic array

DOI10.1002/NET.3230170103MaRDI QIDQ3794208zbMATH OpenOpenAlexFDO

Authors

Publication date 1987

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230170103

zbMATH Keywords

algorithmbipartite graphNP-complete problemprogrammable logic arraytree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph theoretic analysis of PLA folding heuristics
• On the orderability problem for PLA folding
• The Complexity of Near-Optimal Programmable Logic Array Folding
• scientific article; zbMATH DE number 4070608
• scientific article; zbMATH DE number 139785

Cited in

(12)

• Asymptotic component densities in programmable gate arrays realizing all circuits of a given size
• PLA folding in special graph classes
• Acyclicity in edge-colored graphs
• Paths and trails in edge-colored graphs
• scientific article; zbMATH DE number 4147519 (Why is no real title available?)
• Bipartite convolution of a programmable logic array.
• scientific article; zbMATH DE number 4070608 (Why is no real title available?)
• Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
• Array Folds Logic
• Parallel connectivity in edge-colored complete graphs: complexity results
• On the parallel complexity of the alternating Hamiltonian cycle problem
• Links in edge-colored graphs

This page was built for publication: Graph folding and programmable logic array

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