Efficient generation of plane trees.
From MaRDI portal
Publication:1853129
DOI10.1016/S0020-0190(02)00240-5zbMath1046.68082MaRDI QIDQ1853129
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00240-5
68R10: Graph theory (including graph drawing) in computer science
Related Items
Listing all spanning trees in Halin graphs — sequential and Parallel view, Family Trees for Enumeration, Escape from the room, Random generation and enumeration of bipartite permutation graphs, Efficient enumeration of ordered trees with \(k\) leaves, Enumeration of irredundant forests, A Compact Encoding of Unordered Binary Trees, Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract), Random Generation and Enumeration of Proper Interval Graphs
Cites Work