A loopless Gray code for rooted trees

DOI10.1145/1150334.1150335MaRDI QIDQ2944510zbMATH OpenOpenAlexFDO

Authors James F. Korsh, Paul S. jun. LaFollette

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1150334.1150335

zbMATH Keywords

Gray coderooted trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Loopless generation of Gray codes for \(k\)-ary trees
• Efficient loopless generation of Gray codes for \(k\)-ary trees.
• Binary tree gray codes
• Generating binary trees by transpositions
• Generating ordered trees

Cited in

(9)

• Loopless generation of Gray codes for \(k\)-ary trees
• Efficient loopless generation of Gray codes for \(k\)-ary trees.
• A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
• Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
• Generating binary trees by transpositions
• scientific article; zbMATH DE number 1439483 (Why is no real title available?)
• Combinatorial Algorithms for Listing Paths in Minimal Change Order
• Constant time enumeration of weighted trees

This page was built for publication: A loopless Gray code for rooted trees

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