Shifts and loopless generation of \(k\)-ary trees (Q293252): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6590695 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial problems | |||
Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial algorithms | |||
Property / zbMATH Keywords: combinatorial algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
data structures | |||
Property / zbMATH Keywords: data structures / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
binary trees | |||
Property / zbMATH Keywords: binary trees / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(k\)-ary trees | |||
Property / zbMATH Keywords: \(k\)-ary trees / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
loopless generation | |||
Property / zbMATH Keywords: loopless generation / rank | |||
Normal rank |
Revision as of 20:16, 27 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Shifts and loopless generation of \(k\)-ary trees |
scientific article |
Statements
Shifts and loopless generation of \(k\)-ary trees (English)
0 references
9 June 2016
0 references
combinatorial problems
0 references
combinatorial algorithms
0 references
data structures
0 references
binary trees
0 references
\(k\)-ary trees
0 references
loopless generation
0 references