A loopless algorithm for generating the permutations of a multiset
V Vajnovszki - Theoretical Computer Science, 2003 - Elsevier
Theoretical Computer Science, 2003•Elsevier
Many combinatorial structures can be constructed from simpler components. For example, a
permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a
combination. In this paper we present a constructor for combinatorial structures, called
shuffle on trajectories (defined previously in a non-combinatorial context), and we show how
this constructor enables us to obtain a new loopless generating algorithm for multiset
permutations from similar results for simpler objects.
permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a
combination. In this paper we present a constructor for combinatorial structures, called
shuffle on trajectories (defined previously in a non-combinatorial context), and we show how
this constructor enables us to obtain a new loopless generating algorithm for multiset
permutations from similar results for simpler objects.
Many combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shuffle on trajectories (defined previously in a non-combinatorial context), and we show how this constructor enables us to obtain a new loopless generating algorithm for multiset permutations from similar results for simpler objects.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果