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

DOI10.1093/comjnl/30.3.282zbMath0653.68061OpenAlexW1982457598MaRDI QIDQ5903738

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

rankingbit-stringsgenerating of t-ary treeslexicographic listing

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

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

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