Standard young tableaux of height 4 and 5
European Journal of Combinatorics
Random and uniform word generation
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Uniform random generation of words of rational languages
Theoretical Computer Science - Special issue: selected papers from “GASCOM '94” and the “Polyominoes and Tilings” workshops
Stack words, standard tableaux and Baxter permutations
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Proceedings of the 7th conference on Formal power series and algebraic combinatorics
Determinant algorithms for random planar structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Another involution principle-free bijective proof of Stanley's hook-content formula
Journal of Combinatorial Theory Series A
Uniform Random Generation of Balanced Parenthesis Strings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Orderly spanning trees with applications to graph encoding and graph drawing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On topological aspects of orientations
Discrete Mathematics
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Floor-Planning via Orderly Spanning Trees
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Optimal Area Algorithm for Planar Polyline Drawings
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A benchmark set for the reconstruction of hv-convex discrete sets
Discrete Applied Mathematics
The height and range of watermelons without wall
European Journal of Combinatorics
| Hi-index | 0.00 |
Watermelons are particular configurations of vicious walkers. In these configurations, each path starts and ends at the same ordinate. We present a simple uniform random generation algorithm of watermelons based on enumeration formulas of star configurations (with or without a wall). The performance of this algorithm is better than earlier ones in the case of watermelons with few walkers.Using appropriate bijections, these algorithms can also generate underdiagonal paths, realizers (or Schnyder Trees), twin parallelogram polyominoes according to their perimeter and width, Baxter permutations according to the number of rises, etc. Moreover, we present some experimental results on the height of watermelons and realizers.