Efficient generation of plane trees.
From MaRDI portal
Publication:1853129
DOI10.1016/S0020-0190(02)00240-5zbMATH Open1046.68082OpenAlexW2042395260MaRDI QIDQ1853129FDOQ1853129
Authors: 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
Recommendations
Cites Work
Cited In (21)
- Listing All Plane Graphs
- Random generation and enumeration of bipartite permutation graphs
- Escape from the room
- Loopless Generation of Trees with Specified Degrees
- Efficient enumeration of ordered trees with \(k\) leaves
- Random Generation and Enumeration of Proper Interval Graphs
- Family Trees for Enumeration
- Listing all spanning trees in Halin graphs -- sequential and parallel view
- Correspondences between plane trees and binary sequences
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- Title not available (Why is that?)
- Listing All Plane Graphs
- Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
- A Gray code of ordered trees
- Generating trees on multisets
- Enumeration of irredundant forests
- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
- A compact encoding of unordered binary trees
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Title not available (Why is that?)
This page was built for publication: Efficient generation of plane trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853129)