Sciweavers

4 search results - page 1 / 1
» On the minimum number of completely 3-scrambling permutation...
Sort
View
SIAMDM
2010
89views more  SIAMDM 2010»
13 years 5 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
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
14 years 3 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
DMGT
2011
94views more  DMGT 2011»
13 years 2 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...