Ara
Toplam kayıt 2, listelenen: 1-2
Crossing minimization in weighted bipartite graphs
(Elsevier B.V., 2009-12)
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The ...
Comment on "Encryption and decryption of images with chaotic map lattices" [Chaos 16, 033118 (2006)]
(American Institute of Physics Inc., 2008-09)
In this paper, we comment on the chaotic encryption algorithm proposed by A. N. Pisarchik et al. [Chaos 16, 033118 (2006)]. We demonstrate that the algorithm is not invertible. We suggest simple modifications that can ...