Shifts and loopless generation of \(k\)-ary trees
From MaRDI portal
Publication:293252
DOI10.1016/S0020-0190(97)00215-9zbMath1338.68052MaRDI QIDQ293252
James F. Korsh, Seymour Lipschutz
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097002159?np=y
combinatorial problems; data structures; \(k\)-ary trees; binary trees; combinatorial algorithms; loopless generation
68W05: Nonnumerical algorithms
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
Related Items
Loopless Algorithms And SchrÖder Trees, A loopless algorithm for generating multiple binary tree sequences simultaneously, On generating \(k\)-ary trees in computer representation, Efficient loopless generation of Gray codes for \(k\)-ary trees., A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously
Cites Work