Sciweavers

59
Voted
SIAMDM
2010
89views more  SIAMDM 2010»
14 years 3 months ago
Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
Wei-Tian Li, Linyuan Lu, Yiting Yang