Geodesic
A reduced graph algorithm to investigate bifurcations
Matematičeskoe modelirovanie, Tome 17 (2005) no. 1, pp. 10-18 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

An algorithm of construction of some subgraph of bifurcation graph for symmetrical systems of equations is reported in the paper. It is proved also that the subgraph contains one and only one representative from every equivalence class of complete bifurcation routes. One more algorithm is developed which is more effectively deletes conjugate structures. 
@article{MM_2005_17_1_a1,
     author = {Yu. V. Troshchiev},
     title = {A reduced graph algorithm to investigate bifurcations},
     journal = {Matemati\v{c}eskoe modelirovanie},
     pages = {10--18},
     year = {2005},
     volume = {17},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MM_2005_17_1_a1/}
}
TY  - JOUR
AU  - Yu. V. Troshchiev
TI  - A reduced graph algorithm to investigate bifurcations
JO  - Matematičeskoe modelirovanie
PY  - 2005
SP  - 10
EP  - 18
VL  - 17
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MM_2005_17_1_a1/
LA  - ru
ID  - MM_2005_17_1_a1
ER  - 
%0 Journal Article
%A Yu. V. Troshchiev
%T A reduced graph algorithm to investigate bifurcations
%J Matematičeskoe modelirovanie
%D 2005
%P 10-18
%V 17
%N 1
%U http://geodesic.mathdoc.fr/item/MM_2005_17_1_a1/
%G ru
%F MM_2005_17_1_a1
Yu. V. Troshchiev. A reduced graph algorithm to investigate bifurcations. Matematičeskoe modelirovanie, Tome 17 (2005) no. 1, pp. 10-18. http://geodesic.mathdoc.fr/item/MM_2005_17_1_a1/