In this paper two R‑L network simulator configurations employing a single VDDIBA, one resistance and one grounded capacitance are presented. The first configuration is a grounded series resistor-inductor (R‑L) network simulator and the second configuration is intended for grounded parallel resister-inductor (R‑L) circuit simulation. Both the proposed circuits enjoy several beneficial features s...

We consider the problem of testing sequentially the components of a multi component system, when the testing of each component is costly. We consider a polynomial time testing policy for series-parallel systems, proposed in the literature. Generalizing published results, we prove that the considered policy is cost-minimal in the average case sense, for two sub-families of series-parallel system...

The length of a tree-decomposition graph is the maximum distance (in graph) between two vertices same bag decomposition. treelength minimum among its tree-decompositions. Treelength graphs has been studied for algorithmic applications in classical metric problems such as Traveling Salesman Problem or dimension and also, compact routing context distributed computing. Deciding whether general at ...

The length of a tree-decomposition graph is the maximum distance between two vertices same bag decomposition. treelength minimum among its tree-decompositions. Treelength graphs has been studied for algorithmic applications in classical metric problems such as Traveling Salesman Problem or dimension and also, compact routing context distributed computing. Deciding whether general at most 2 NP-c...