Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order (Q5903738): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/comjnl/30.3.282 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982457598 / rank | |||
Normal rank | |||
Latest revision as of 14:25, 19 March 2024
scientific article; zbMATH DE number 4066355
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order |
scientific article; zbMATH DE number 4066355 |
Statements
Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order (English)
0 references
1987
0 references
generating of t-ary trees
0 references
ranking
0 references
lexicographic listing
0 references
bit-strings
0 references
