Constant time generation of trees with specified diameter
From MaRDI portal
Recommendations
Cited in
(22)- Skyline groups are ideals. An efficient algorithm for enumerating skyline groups
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- Generating All Triangulations of Plane Graphs (Extended Abstract)
- Random Generation and Enumeration of Proper Interval Graphs
- Efficient enumeration of ordered trees with \(k\) leaves
- Constant Time Generation of Free Trees
- Generation, ranking and unranking of ordered trees with degree bounds
- An Efficient Algorithm for Enumerating Pseudo Cliques
- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
- Graph-Theoretic Concepts in Computer Science
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- Family Trees for Enumeration
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
- Constant time enumeration of weighted trees
- Enumerating floorplans with any set of columns
- Listing closed sets of strongly accessible set systems with applications to data mining
- An efficient algorithm for solving pseudo clique enumeration problem
- Counting the number of independent sets in chordal graphs
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Efficient enumeration of all ladder lotteries and its application
This page was built for publication: Constant time generation of trees with specified diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710816)