Geodesic
Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
The electronic journal of combinatorics, Tome 19 (2012) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

By considering a permutation representation for stamp-foldings and semi-meanders we construct tree-like data structures that will allow us to generate these objects in constant amortized time. Additionally, by maintaining the wind-factor and applying an additional optimization, the algorithm for semi-meanders can be modified to produce the fastest known algorithm to generate open meanders.
DOI : 10.37236/2404
Classification : 68R05, 68P05, 05A99
Mots-clés : stamp folding, semi-meander, meander, CAT algorithm, permutation 
@article{10_37236_2404,
     author = {Joe Sawada and Roy Li},
     title = {Stamp foldings, semi-meanders, and open meanders: fast generation algorithms},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {2},
     doi = {10.37236/2404},
     zbl = {1252.68209},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2404/}
}
TY  - JOUR
AU  - Joe Sawada
AU  - Roy Li
TI  - Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2404/
DO  - 10.37236/2404
ID  - 10_37236_2404
ER  - 
%0 Journal Article
%A Joe Sawada
%A Roy Li
%T Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2404/
%R 10.37236/2404
%F 10_37236_2404
Joe Sawada; Roy Li. Stamp foldings, semi-meanders, and open meanders: fast generation algorithms. The electronic journal of combinatorics, Tome 19 (2012) no. 2. doi: 10.37236/2404

Cité par Sources :