Shifts and loopless generation of k-ary trees

DOI10.1016/S0020-0190(97)00215-9zbMATH Open1338.68052OpenAlexW1973129651MaRDI QIDQ293252FDOQ293252

Authors: 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

Recommendations

• Loopless generation of \(k\)-ary tree sequences
• Loopless generation of Gray codes for \(k\)-ary trees
• Efficient Generation of k-ary Trees in Natural Order
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
• A Loopless Gray-Code Algorithm for Listing k-ary Trees

zbMATH Keywords

binary treesdata structurescombinatorial problems\(k\)-ary treescombinatorial algorithmsloopless generation

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Nonnumerical algorithms (68W05)

Cites Work

• Generating t-ary trees in A-order
• A loopless algorithm for generating binary tree sequences
• Loopless generation of \(k\)-ary tree sequences
• On Rotations and the Generation of Binary Trees

Cited In (9)

• Recursive generation of \(k\)-ary trees
• Loopless Generation of Schroder Trees
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• Loopless generation of \(k\)-ary tree sequences
• Efficient loopless generation of Gray codes for \(k\)-ary trees.
• On generating \(k\)-ary trees in computer representation
• Loopless Algorithms And SchrÖder Trees
• Generating Regular k-ary Trees Efficiently

This page was built for publication: Shifts and loopless generation of \(k\)-ary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293252)