Shifts and loopless generation of \(k\)-ary trees

DOI10.1016/S0020-0190(97)00215-9zbMath1338.68052OpenAlexW1973129651MaRDI 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

zbMATH Keywords

combinatorial problemsdata structures\(k\)-ary treesbinary treescombinatorial algorithmsloopless generation

Mathematics Subject Classification ID

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

Related Items (5)

A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ 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.

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

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