Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
From MaRDI portal
Publication:5903738
DOI10.1093/comjnl/30.3.282zbMath0653.68061OpenAlexW1982457598MaRDI QIDQ5903738
Publication date: 1987
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/30.3.282
Related Items
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order, Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order, Staircase tilings and \(k\)-Catalan structures