Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems.
From MaRDI portal
Publication:5955805
DOI10.1007/BF02802550zbMath1075.68671OpenAlexW1976082436MaRDI QIDQ5955805
Publication date: 18 February 2002
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02802550
Cites Work
- An optimal parallel algorithm for generating combinations
- A New Algorithm for Generating Binary Trees using Rotations
- Generating binary trees using rotations
- Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
- A note on generating binary trees inA-order andB-order
This page was built for publication: Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems.