Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Handbook of theoretical computer science (vol. A)
Tree-width, path-width, and cutwidth
Discrete Applied Mathematics
On Polynomial-Time Testable Combinational Circuits
IEEE Transactions on Computers
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
| Hi-index | 14.98 |
A (k,K) circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no more than K external inputs, such that the graph formed by letting each block be a node and inserting edges between blocks if they share a signal line, is a partial k-tree. (k,K) circuits are special in that they have been shown to be testable in time polynomial in the number of gates in the circuit, and are useful if the constants k and K are small. We demonstrate a procedure to synthesise (k,K) circuits from a special class of Boolean expressions.