Loopless Generation of Trees with Specified Degrees

DOI10.1093/COMJNL/45.3.364MaRDI QIDQ4551658zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
• Generating ordered trees
• scientific article; zbMATH DE number 1439483
• Efficient generation of plane trees.

Cited in

(11)

• Loop-free Gray code algorithms for the set of compositions
• Gray codes, loopless algorithm and partitions
• Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
• Loopless Generation of Schroder Trees
• Efficient enumeration of ordered trees with \(k\) leaves
• A shift Gray code for fixed-content Łukasiewicz words
• Ordered trees and the inorder traversal
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• Loopless generation of \(k\)-ary tree sequences
• Constant time generation of derangements
• scientific article; zbMATH DE number 3935065 (Why is no real title available?)

This page was built for publication: Loopless Generation of Trees with Specified Degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551658)