Geodesic
A decomposition algorithm for the oriented adjacency graph of the triangulations of a bordered surface with marked points
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we consider an oriented version of adjacency graphs of triangulations of bordered surfaces with marked points. We develop an algorithm that determines whether a given oriented graph is an oriented adjacency graph of a triangulation. If a given oriented graph corresponds to many triangulations, our algorithm finds all of them. As a corollary we find out that there are only finitely many oriented connected graphs with non-unique associated triangulations. We also discuss a new algorithm which determines whether a given quiver is of finite mutation type. This algorithm is linear in the number of nodes and is more effective than the previously known one.
DOI : 10.37236/578
Classification : 05C85, 05C70 
@article{10_37236_578,
     author = {Weiwen Gu},
     title = {A decomposition algorithm for the oriented adjacency graph of the triangulations of a bordered surface with marked points},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/578},
     zbl = {1217.05213},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/578/}
}
TY  - JOUR
AU  - Weiwen Gu
TI  - A decomposition algorithm for the oriented adjacency graph of the triangulations of a bordered surface with marked points
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/578/
DO  - 10.37236/578
ID  - 10_37236_578
ER  - 
%0 Journal Article
%A Weiwen Gu
%T A decomposition algorithm for the oriented adjacency graph of the triangulations of a bordered surface with marked points
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/578/
%R 10.37236/578
%F 10_37236_578
Weiwen Gu. A decomposition algorithm for the oriented adjacency graph of the triangulations of a bordered surface with marked points. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/578

Cité par Sources :