A fast algorithm for generating set partitions

Authors:
M. C. Er
Affiliations:
The Univ. of Western Australia, Nedlands
Venue:
The Computer Journal
Year:
1988

Citing 0
Cited 7

A fast algorithm to generate unlabeled necklaces

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
RGFGA: An Efficient Representation and Crossover for Grouping Genetic Algorithms

Evolutionary Computation
An improved restricted growth function genetic algorithm for the consensus clustering of retinal nerve fibre data

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Solving necklace constraint problems

Journal of Algorithms
Solving Necklace Constraint Problems

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Dynamic structural symmetry breaking for constraint satisfaction problems

Constraints
A new algorithm for generation of exactly m–block set partitions in associative model

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract