Loopless generation of Gray codes for \(k\)-ary trees
type: Item
instance of: scholarly article
title: Loopless generation of Gray codes for \(k\)-ary trees
zbMATH Open document ID: 1002.68102
DOI: 10.1016/S0020-0190(99)00035-6
author: James F. Korsh
author: Paul S. jun. LaFollette
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1771659
MaRDI profile type: Publication
full work available at URL: s0020-0190(99)00035-6
OpenAlex ID: W1967896791
Recommended article: Efficient loopless generation of Gray codes for \(k\)-ary trees.
Recommended article: A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order
Recommended article: A loopless Gray code for rooted trees
Recommended article: A Loopless Gray-Code Algorithm for Listing k-ary Trees
Recommended article: Q4489211
Recommended article: Loopless generation of \(k\)-ary tree sequences
Recommended article: Loop Free Generation ofK-Ary Trees
Recommended article: On the generation of binary trees from (0–1) codes
Recommended article: Loop-free Gray code algorithms for the set of compositions
Recommended article: Gray codes, loopless algorithm and partitions
description: scientific article; zbMATH DE number 1771659