Paper Info
Title
Rubik Routing Permutations on Graphs
Abstract
We consider the permutation routing problem on undirected graphs when the routings correspond to products of elements of some fixed set. Previous work has concerned only two-way links. We introduce here the Rubik routing model in order to study the one-way case. We give a complete characterization of Rubik rearrangeable graphs and we study how the 2D grid and the hypercube behave with respect to Rubik routing of permutations.
Year
DOI
Venue
1996
10.1007/3-540-61626-8_37
Euro-Par, Vol. I
Keywords
Field
DocType
rubik routing permutations
Permutation graph,Discrete mathematics,Graph,Computer science,Parallel computing,Permutation,Hypercube,Grid
Conference
ISBN
Citations 
PageRank 
3-540-61626-8
1
0.36
References 
Authors
5
2
Name
Order
Citations
PageRank
Charles Delorme14323.16
Petrisor Panaite2222.92