In the architecture of cellular neural networks (CNN), connections among cells are built on linear coupling laws. These laws are characterized by the so-called templates which exp...
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Lee distance Gray codes for -ary Ò-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly generate edge disjoint Hamilto...
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we ex...
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...