Loopless Generation of Trees with Specified Degrees

DOI10.1093/comjnl/45.3.364zbMath1003.68115OpenAlexW2121932085MaRDI 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

zbMATH Keywords

loopless algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Constant time generation of derangements ⋮ A shift Gray code for fixed-content Łukasiewicz words ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Loop-free Gray code algorithms for the set of compositions ⋮ Ordered trees and the inorder traversal ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Gray codes, loopless algorithm and partitions