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

DOI10.1006/jagm.1999.1073zbMath0954.68054OpenAlexW2038337290MaRDI QIDQ4953247

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)

Related Items (9)

A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ The rotation graph of \(k\)-ary trees is Hamiltonian ⋮ Gray codes for reflectable languages ⋮ Generating binary trees by Glivenko classes on Tamari lattices ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ 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.

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