PLA folding in special graph classes

DOI10.1016/0166-218X(94)90094-9zbMath0810.68101MaRDI QIDQ1329804

Peter Damaschke

Publication date: 31 July 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

treescographsinterval graphsdynamic programming methodsfolding problems

Mathematics Subject Classification ID

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

Cites Work

• Completely separable graphs
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
• Matching theory
• Complement reducible graphs
• \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs
• Graph folding and programmable logic array
• On the Interplay Between Interval Dimension and Dimension
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: PLA folding in special graph classes