Заглавие | Some examples of lexicographic order algorithms and some open combinatorial problems |
Вид публикация | Journal Article |
Година на публикуване | 1997 |
Автори | Vandev D |
Списание | Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique |
Том | 89 |
Issue | Livre 2 - Mathématiques Appliquée et Informatique |
Pagination | 203-2015 |
ISSN | 0205-0808 |
ключови думи | enumerating algorithms, lexicographic order functions |
Резюме | A general reasoning based on the lexicographic order is studied. It helps to create algorithms for generation of sets of words having certain natural and good properties. Several examples are considered and the performance of the proposed algorithms is calculated. An open combinatorial problem regarding the set of partitions arises. |
1991/95 MSC | 68E05, 65C20 |
Прикачен файл | Размер |
---|---|
89-203-215.pdf | 1.25 MB |