Skip to search formSkip to main contentSkip to account menu

Steinhaus–Johnson–Trotter algorithm

Known as: Johnson–Trotter algorithm, Steinhaus-Johnson-Trotter, Johnson–Trotter 
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Aus Anlass der Flurbereinigung 'Vriescheloo' im aussersten Nordosten der Niederlande, wurde 1987 in einem ehemaligen Moorgebiet… 
2006
2006
A loopless algorithm is a procedure for generating a list of values under two restrictions: the first element should be produced… 
2005
2005
J. JAW~CEK: J. olin. Invest. 37, 660, (1958). ~ ~ VEI~E:f, E. B., and M.¥ooT: Quart. &exp. Physiol. 28, 253 (1938).--2~v WAK~5… 
Review
2003
Review
2003
Scholars frequently acknowledge the force of political Islam in shaping the Muslim societies of Africa and Asia, but seldom… 
2003
2003
Two completely new algorithms for generating permutations, shift-cursor algorithm and level algorithm, and their efficient… 
2001
2001
Sperner’s bound on the size of an antichain in the lattice P(S) of subsets of a finite set S has been generalized in three… 
1997
1997
Corneal, lenticular, and retinal damage have been observed following exposures to a laser emitting in the near-infrared…