Ara
Toplam kayıt 12, listelenen: 11-12
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 ...
Cryptanalysis of a cryptosystem based on discretized two-dimensional chaotic maps
(Elsevier Science BV, 2008-11-17)
Recently, an encryption algorithm based on two-dimensional discretized chaotic maps was proposed [Xiang et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we analyze the security weaknesses of the proposal. Using the ...