Loopless Generation of Trees with Specified Degrees
From MaRDI portal
Publication:4551658
DOI10.1093/comjnl/45.3.364zbMath1003.68115MaRDI QIDQ4551658
James F. Korsh, Paul S. jun. LaFollette
Publication date: 6 October 2002
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/45.3.364
68R10: Graph theory (including graph drawing) in computer science
Related Items
Efficient enumeration of ordered trees with \(k\) leaves, Loop-free Gray code algorithms for the set of compositions, Gray codes, loopless algorithm and partitions, A shift Gray code for fixed-content Łukasiewicz words, Constant time generation of derangements, Ordered trees and the inorder traversal, Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)