PLA folding in special graph classes
From MaRDI portal
Recommendations
Cites work
- -vertex separator is NP-hard even for 3-regular graphs
- Complement reducible graphs
- Completely separable graphs
- Graph folding and programmable logic array
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- scientific article; zbMATH DE number 139785 (Why is no real title available?)
- scientific article; zbMATH DE number 219249 (Why is no real title available?)
- scientific article; zbMATH DE number 4116559 (Why is no real title available?)
- scientific article; zbMATH DE number 4121424 (Why is no real title available?)
- Matching theory
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- On the Interplay Between Interval Dimension and Dimension
Cited in
(7)- On the orderability problem for PLA folding
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- The Complexity of Near-Optimal Programmable Logic Array Folding
- scientific article; zbMATH DE number 139785 (Why is no real title available?)
- scientific article; zbMATH DE number 1127073 (Why is no real title available?)
- Graph models for PLA folding problems
- scientific article; zbMATH DE number 5211465 (Why is no real title available?)
This page was built for publication: PLA folding in special graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329804)