Generating rooted and free plane trees

DOI10.1145/1125994.1125995MaRDI QIDQ2944503zbMATH OpenOpenAlexFDO

Authors Joe Sawada

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1125994.1125995

zbMATH Keywords

CAT algorithmchord diagramfree plane treenecklaceplanar treerooted plane tree

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Efficient generation of plane trees.
• Constant Time Generation of Free Trees
• Listing All Plane Graphs
• scientific article; zbMATH DE number 1305528
• scientific article; zbMATH DE number 3961006

Cited in

(8)

• Rooted and unrooted tree-search algorithms
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• scientific article; zbMATH DE number 4091527 (Why is no real title available?)
• scientific article; zbMATH DE number 1305528 (Why is no real title available?)
• Efficient enumeration of ordered trees with \(k\) leaves
• Constant Time Generation of Free Trees
• Fast generation of unlabelled free trees using weight sequences
• Integer sequence discovery from small graphs

This page was built for publication: Generating rooted and free plane trees

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