Some examples of lexicographic order algorithms and some open combinatorial problems

Заглавие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
IssueLivre 2 - Mathématiques Appliquée et Informatique
Pagination203-2015
ISSN0205-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

Прикачен файлРазмер
PDF icon 89-203-215.pdf1.25 MB