Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order

DOI10.1093/COMJNL/30.3.282zbMath0653.68060OpenAlexW1982457598MaRDI QIDQ5903737

M. C. Er

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

zbMATH Keywords

backtrackingefficient generation of permutations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

This page was built for publication: Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order