Free Access
Issue
RAIRO-Oper. Res.
Volume 13, Number 4, 1979
Page(s) 379 - 390
DOI https://doi.org/10.1051/ro/1979130403791
Published online 06 February 2017
  • 1. C. BERGE, Principes de combinatoire, Dunod, Paris, 1968. [MR: 237346] [Zbl: 0227.05001]
  • 2. G. EHRLICH, Loopless Algorithms for Generating Permutations and other Combinatorial Configurations, Journal of A.C.M., vol. 20, n° 3, 1973. [MR: 366085] [Zbl: 0266.68018]
  • 3. W. FERNANDEZ DE LA VEGA et A. GUENOCHE, Génération des partitions aléatoires uniformément distribuées, Actes du Colloque A.F.C.E.T.-S.M.F. Palaiseau, 1978, p. 285, 291. [Zbl: 0484.60015]
  • 4. A. GUENOCHE, Énumération des tableaux standards, Discrete Math., vol. 25, 1979, p. 1-11. [MR: 534942] [Zbl: 0402.05005]
  • 5. F. M. IVES, Permutation Enumeration : Four New Permutation Algorithms, Communication A.C.M., vol. 19, n° 2, 1976, p. 68-72. [Zbl: 0316.05007]
  • 6. S. M. JOHNSON, Generation of Permutation by Adjacent Transpositions, Math. Comp., vol. 17, 1963. [MR: 159764] [Zbl: 0114.01203]
  • 7. A. NIJENMUIS et H. S. WILF, Combinatorial Algorithms, Academic Press, 1975. [Zbl: 0343.68004]
  • 8. J. RIORDAN, An Introduction to Combinatorial Analysis, J. Wiley, 1958. [MR: 96594] [Zbl: 0078.00805]
  • 9. H. S. WILF, An Unified Setting for Sequencing, Ranking, and Selection Algorithms for Combinatorial Objects, Advances in Math., vol. 24, 1977, p. 281-291. [MR: 441754] [Zbl: 0354.05041]
  • 10. S. G. WILLIAMSON, On the Ordering, Ranking and Random Generation of Basic Combinatorial Sets, Lecture Notes in Math., n° 579, 1977. [MR: 491212] [Zbl: 0362.05006]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.