Generating rooted and free plane trees

DOI10.1145/1125994.1125995zbMATH Open1321.68450OpenAlexW2082869103MaRDI QIDQ2944503FDOQ2944503

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

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

zbMATH Keywords

necklacechord diagramCAT algorithmplanar treerooted plane treefree plane tree

Mathematics Subject Classification ID

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

Cited In (8)

• Constant Time Generation of Free Trees
• Rooted and unrooted tree-search algorithms
• Efficient enumeration of ordered trees with \(k\) leaves
• Fast generation of unlabelled free trees using weight sequences
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• Integer sequence discovery from small graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)