Listing combinatorial objects in parallel

DOI10.1080/17445760500355777zbMATHOpenAlexMaRDI QIDQ3378053FDO

Authors Ivan Stojmenović

Publication date 29 March 2006

Published in International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/17445760500355777

zbMATH Keywords

permutationscombinatorial algorithmscombinationslinear array of processorssubsets

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Generating combinations in parallel
• Parallel comparison merging of many-ordered lists
• Fast enumeration of combinatorial objects
• Spectral Analysis of an Oscillating Thermoviscoelastic Plate in a Transverse Magnetic Field
• On linear list recursion in parallel
• Deterministic parallel list ranking
• scientific article; zbMATH DE number 4064468
• Parallel generation of permutations and combinations
• A parallel algorithm for generating combinations

Cites work

• scientific article; zbMATH DE number 53193 (Why is no real title available?)
• A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL
• A parallel derangement generation algorithm
• A systolic design for generating permutations in lexicographic order
• A systolic generation of combinations
• An optimal algorithm for generating equivalence relations on a linear array of processors
• An optimal parallel algorithm for generating combinations
• An optimal systolic algorithm for generating permutations in lexicographic order
• Constant time generation of derangements
• Generating combinations in parallel
• Gray code for derangements
• Loopless Generation of Schroder Trees
• New methods for the generation of permutations, combinations, and other combinatorial objects in parallel
• On \(O(1)\) time algorithms for combinatorial generation
• On generation of permutations through decomposition of symmetric groups into cosets
• On random and adaptive parallel generation of combinatorial objects
• Parallel Generation of Permutations
• Parallel algorithm for generating permutations on linear array
• Parallel generation of permutations and combinations

Cited in

(5)

• Sequential and parallel enumeration
• Efficient Algorithms for Listing Combinatorial Structures
• Unified selection from lists, arrays, and objects.
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
• Direct-chaining with coalescing lists

This page was built for publication: Listing combinatorial objects in parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378053)