A loopless Gray code for rooted trees

DOI10.1145/1150334.1150335zbMath1321.68448OpenAlexW2022419565MaRDI QIDQ2944510

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

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

Related Items (3)

Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Combinatorial Algorithms for Listing Paths in Minimal Change Order

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