Efficient generation of plane trees.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1545695 (Why is no real title available?)
- Constant Time Generation of Free Trees
- Constant Time Generation of Rooted Trees
- Efficient Algorithms for Listing Combinatorial Structures
- Generating rooted triangulations without repetitions
- Isomorph-Free Exhaustive Generation
Cited in
(21)- scientific article; zbMATH DE number 434865 (Why is no real title available?)
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- A compact encoding of unordered binary trees
- scientific article; zbMATH DE number 3961006 (Why is no real title available?)
- Listing All Plane Graphs
- Family Trees for Enumeration
- Efficient enumeration of ordered trees with \(k\) leaves
- Listing All Plane Graphs
- Listing all spanning trees in Halin graphs -- sequential and parallel view
- Random generation and enumeration of bipartite permutation graphs
- Random Generation and Enumeration of Proper Interval Graphs
- Correspondences between plane trees and binary sequences
- A Gray code of ordered trees
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
- Generating trees on multisets
- Enumeration of irredundant forests
- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
- Escape from the room
- Loopless Generation of Trees with Specified Degrees
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)
