Results 181 to 190 of about 2,888 (202)
Some of the next articles are maybe not open access.
Congestion-free Routings of Linear Complement Permutations
SIAM Journal on Discrete Mathematics, 1998We present an off-line method for routing a linear complement permutation on a hypercube. The routing has the virtue of being congestion-free. Our method is purely algebraic, and the routing involves row reducing an invertible matrix to the identity by means of special row operations.
openaire +1 more source
Disjoint permutation matrices in complements of trees
Linear and Multilinear Algebra, 1979The largest number of disjoint permutation matrices in the complement of a tree matrix is ...
openaire +1 more source
On the existence of a stable complementing permutation in a \(t\)-sc graph
Ars Comb., 1996The paper deals with the problem of the decomposition of a complete graph into isomorphic factors. This problem is introduced as a generalization of a self-complementary graph, and called a {\(t\)-sc graph} (\(t\) is the number of factors). A \(t\)-sc graph has a {stable self-complementing permutation} \(\pi \) if all its factors are obtained by ...
openaire +1 more source
Optimal Self-Routing of Linear-Complement Permutations in Hypercubes
Proceedings of the Fifth Distributed Memory Computing Conference, 1990., 2005R. Boppana, C.S. Raghavendra
openaire +1 more source
On the Security of Permutation-Only Image Encryption Schemes
IEEE Transactions on Information Forensics and Security, 2016Alireza Jolfaei
exaly
Permutation entropy: A nonlinear statistical measure for status characterization of rotary machines
Mechanical Systems and Signal Processing, 2012Ruqiang Yan, Yongbin Liu, Robert Gao
exaly