Efficient generation of plane trees.

DOI10.1016/S0020-0190(02)00240-5zbMath1046.68082OpenAlexW2042395260MaRDI QIDQ1853129

Shin-ichi Nakano

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

zbMATH Keywords

AlgorithmsGraphsEnumerationListingPlane treesPlane graphs

Mathematics Subject Classification ID

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

Related Items

Enumeration of irredundant forests ⋮ Family Trees for Enumeration ⋮ Escape from the room ⋮ Random generation and enumeration of bipartite permutation graphs ⋮ Listing all spanning trees in Halin graphs — sequential and Parallel view ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ 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

• Unnamed Item
• Unnamed Item
• Generating rooted triangulations without repetitions
• Constant Time Generation of Rooted Trees
• Efficient Algorithms for Listing Combinatorial Structures
• Isomorph-Free Exhaustive Generation
• Constant Time Generation of Free Trees