Generating rooted and free plane trees

DOI10.1145/1125994.1125995zbMath1321.68450OpenAlexW2082869103MaRDI QIDQ2944503

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

chord diagramnecklaceCAT algorithmplanar treerooted plane treefree plane tree

Mathematics Subject Classification ID

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

Related Items (4)

Integer sequence discovery from small graphs ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Fast Generation of Unlabelled Free Trees using Weight Sequences

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