A Loopless Gray-Code Algorithm for Listing k-ary Trees

DOI10.1006/JAGM.1999.1073MaRDI QIDQ4953247zbMATH OpenOpenAlexFDO

Authors Dominique Roelants van Baronaigien

Publication date 4 October 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1999.1073

zbMATH Keywords

Gray-code orderloop free algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• Publication:4489211
• Loopless generation of Gray codes for \(k\)-ary trees
• Efficient loopless generation of Gray codes for \(k\)-ary trees.
• Loopless generation of \(k\)-ary tree sequences
• Lexicographic Enumeration of k-ary Trees

Cited in

(16)

• The rotation graph of \(k\)-ary trees is Hamiltonian
• Greedy Gray codes for Dyck words and ballot sequences
• A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
• Shifts and loopless generation of \(k\)-ary trees
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• Generating binary trees by Glivenko classes on Tamari lattices
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order
• Efficient loopless generation of Gray codes for \(k\)-ary trees.
• On generating \(k\)-ary trees in computer representation
• Loopless generation of Gray codes for \(k\)-ary trees
• Generating a Gray code for P-sequences
• scientific article; zbMATH DE number 1472158 (Why is no real title available?)
• Gray codes for reflectable languages
• Lexicographic Enumeration of k-ary Trees
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order

This page was built for publication: A Loopless Gray-Code Algorithm for Listing k-ary Trees

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