On random and adaptive parallel generation of combinatorial objects
From MaRDI portal
Publication:3989785
DOI10.1080/00207169208804056zbMath0742.68046OpenAlexW2111276064WikidataQ126245661 ScholiaQ126245661MaRDI QIDQ3989785
Publication date: 28 June 1992
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169208804056
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Random number generation in numerical analysis (65C10)
Related Items
A simple systolic algorithm for generating combinations in lexicographic order ⋮ Listing combinatorial objects in parallel ⋮ Generating random binary trees -- a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal parallel algorithm for generating combinations
- An optimal algorithm for generating equivalence relations on a linear array of processors
- Parallel algorithm for generating permutations on linear array
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Generating combinations in parallel
- Parallel generation of permutations and combinations
- Generating a random cyclic permutation
- Lexicographic generation of ordered trees
- A method and two algorithms on the theory of partitions
- A systolic generation of combinations
- Generating random combinatorial objects
- Parallel Generation of Permutations
- Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
- A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
- Observations on the generation of permutations from random sequences
- Permutation Generation on Vector Processors
- A numbering system for binary trees
- Generating Binary Trees Lexicographically
- Ranking and Listing Algorithms for k-Ary Trees
