|
Description: |
I shall discuss about combinatorial Gray codes and explicit designs of efficient algorithms for lexicographical combinatorial generation of the sets of nonnesting and sparse nonnesting set partitions of length n and type A.
|
Date: |
|
Start Time: |
16:00 |
Speaker: |
Alessandro Conflitti (CMUC, Univ. Coimbra)
|
Institution: |
CMUC/UC
|
Place: |
Room 2.4
|
Research Groups: |
-Algebra and Combinatorics
|
See more:
|
<Main>
|
|