Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference5 articles.
1. S. M. Johnson,Generation of permutations by adjacent transpositions, Math. Comput. 17 (1963), 282–285.
2. H. F. Trotter,Algorithm 115, Perm. Comm. ACM 5, 8 (Aug. 1962), 434–435.
3. G. Ehrlich,Loopless algorithms for generating permutations, combinations, and other combinatorial configurations, J. ACM 20, 3 (July 1973), 500–513.
4. G. Ehrlich,Algorithm 466, Permu. Comm. ACM 16, 11 (Nov. 1973), 690–691.
5. S. Even,Algorithmic Combinatorics, Macmillan, New York, 1973, pp. 2–11.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Unified Framework to Discover Permutation Generation Algorithms;The Computer Journal;2021-11-17
2. A Constant-Time Algorithm for Middle Levels Gray Codes;Algorithmica;2019-10-25
3. 1960–1979;A Chronicle of Permutation Statistical Methods;2014
4. 1940–1959;A Chronicle of Permutation Statistical Methods;2014
5. Loopless Generation of Trees with Specified Degrees;The Computer Journal;2002-03-01