The problem of optimizing weighting functions over all the k-subtrees (subtrees with k vertices) of a given tree is considered. A general algorithm is presented that finds an optimal k-subtree of a given tree whenever...
详细信息
The problem of optimizing weighting functions over all the k-subtrees (subtrees with k vertices) of a given tree is considered. A general algorithm is presented that finds an optimal k-subtree of a given tree whenever the weighting function is what we call monotonic. Monotonicity is a very natural property, satisfied by most of the functions that one can think of.
This paper describes several algorithms for solution of linear programs. The algorithms are polynomial when the problem data satisfy certain conditions.
This paper describes several algorithms for solution of linear programs. The algorithms are polynomial when the problem data satisfy certain conditions.
In this correspondence we analyze the computational complexity of fault detection problems for combinational circuits and propose an approach to design for testability. Although major fault detection problems have bee...
详细信息
In this correspondence we analyze the computational complexity of fault detection problems for combinational circuits and propose an approach to design for testability. Although major fault detection problems have been known to be in general NP-complete, they were proven for rather complex circuits. In this correspondence we show that these are still NP-complete even for monotone circuits, and thus for unate circuits. We show that for k-level (k ≥ 3) monotone/unate circuits these problems are still NP-complete, but that these are solvable in polynomial time for 2-level monotone/unate circuits. A class of circuits for which these fault detection problems are solvable in polynomial time is presented. Ripple-carry adders, decoder circuits, linear circuits, etc., belong to this class. A design approach is also presented in which an arbitrary given circuit is changed to such an easily testable circuit by inserting a few additional test-points.
We discuss several forms of thep-center location problems on an undirected tree network. Our approach is based on utilizing results for rigid circuit graphs to obtain polynomial algorithms for solving the model. Duali...
详细信息
We discuss several forms of thep-center location problems on an undirected tree network. Our approach is based on utilizing results for rigid circuit graphs to obtain polynomial algorithms for solving the model. Duality theory on perfect graphs is used to define and solve the dual location model.
暂无评论