π
π
The Cartographer
Optimal Generation of Strictly Increasing Binary Trees and Beyond
June 24, 2024 Β· Declared Dead Β· π International Conference on Random and Exhaustive Generation of Combinatorial Structures
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Olivier Bodini, Francis Durand, Philippe Marchal
arXiv ID
2406.16396
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DM
Citations
1
Venue
International Conference on Random and Exhaustive Generation of Combinatorial Structures
Last Checked
4 months ago
Abstract
This article presents two novel algorithms for generating random increasing trees. The first algorithm efficiently generates strictly increasing binary trees using an ad hoc method. The second algorithm improves the recursive method for weighted strictly increasing unary-binary increasing trees, optimizing randomness usage.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted