Carregant...
Carregant...

Vés al contingut (premeu Retorn)

An Efficient generic algorithm for the generation of unlabelled cycles

Autor
Martinez, C.; Molinero, X.
Tipus d'activitat
Document cientificotècnic
Data
2003-06-06
Codi
LSI-03-35-R
Repositori
http://hdl.handle.net/2117/97029 Obrir en finestra nova
Resum
In this report we combine two recent generation algorithms to obtain a new algorithm for the generation of unlabelled cycles. Sawada's algorithm lists all k-ary unlabelled cycles with fixed content, that is, the number of occurences of each symbol is fixed and given a priori. The other algorithm, by the authors, generates all multisets of objects with given total size n from any admissible unlabelled class A. By admissible we mean that the class can be specificied using atomic classes, disjoint...
Citació
Martinez, C., Molinero, X. "An Efficient generic algorithm for the generation of unlabelled cycles". 2003.
Paraules clau
Generation algorithms, Unlabelled cycles generation
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
GRTJ - Grup de Recerca en Teoria de Jocs

Participants

Arxius