4 search results - page 1 / 1 » On the minimum number of completely 3-scrambling permutation... |
138
Voted
SIAMDM
2010
15 years 23 days ago
2010
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...
150
click to vote
CPM
2001
Springer
15 years 10 months ago
2001
Springer
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...
160
click to vote
DMGT
2011
14 years 9 months ago
2011
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...