VERTEX SPLITTING IN DAGS AND APPLICATIONS TO PARTIAL SCAN DESIGNS AND LOSSY CIRCUITS
From MaRDI portal
Publication:5248984
DOI10.1142/S0129054198000301zbMath1320.94116MaRDI 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
NP-hard; sequential circuits; flip-flop selection; lossy circuits and networks; partial-scan designs; pipelined circuits
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
94C15: Applications of graph theory to circuits and networks
Related Items
