VERTEX SPLITTING IN DAGS AND APPLICATIONS TO PARTIAL SCAN DESIGNS AND LOSSY CIRCUITS

DOI10.1142/S0129054198000301zbMath1320.94116OpenAlexW2115216179MaRDI QIDQ5248984

Doowon Paik, Sudhakar M. Reddy, Sartaj K. Sahni

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054198000301

zbMATH Keywords

NP-hardsequential circuitsflip-flop selectionlossy circuits and networkspartial-scan designspipelined circuits

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Related Items

Splitting plane graphs to outerplanarity