Generating Regular k-ary Trees Efficiently

DOI10.1093/COMJNL/43.4.290zbMATH Open0967.68126OpenAlexW2128819596MaRDI QIDQ4525952FDOQ4525952

Authors: Limin Xiang, Kazuo Ushijima, Selim G. Akl 

Publication date: 25 January 2001

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/43.4.290

Recommendations

• On generating \(k\)-ary trees in computer representation
• Loopless generation of \(k\)-ary tree sequences
• Efficient Generation of k-ary Trees in Natural Order
• Shifts and loopless generation of \(k\)-ary trees
• Loop Free Generation ofK-Ary Trees

zbMATH Keywords

GenWordsR

Mathematics Subject Classification ID

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

Cited In (4)

• A new algorithm for generation of different types of RNA
• Ranking and unranking of non-regular trees with a prescribed branching sequence
• Generating trees and proper Riordan arrays
• On generating \(k\)-ary trees in computer representation

This page was built for publication: Generating Regular k-ary Trees Efficiently

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