Geodesic
Minimization procedure for Hamiltonian Circuit and Graph Isomorphism problems
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 90-91.

Voir la notice de l'article provenant de la source Math-Net.Ru

The aim of this work is to establish relation between the Hamiltonian Circuit problem, the Graph Isomorphism problem and the global optimization problems for some classes of functionals constructed as sums of low dimension polynomials. 
@article{PDM_2010_12_a45,
     author = {R. T. Faizullin},
     title = {Minimization procedure for {Hamiltonian} {Circuit} and {Graph} {Isomorphism} problems},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {90--91},
     publisher = {mathdoc},
     number = {12},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a45/}
}
TY  - JOUR
AU  - R. T. Faizullin
TI  - Minimization procedure for Hamiltonian Circuit and Graph Isomorphism problems
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 90
EP  - 91
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_12_a45/
LA  - ru
ID  - PDM_2010_12_a45
ER  - 
%0 Journal Article
%A R. T. Faizullin
%T Minimization procedure for Hamiltonian Circuit and Graph Isomorphism problems
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 90-91
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2010_12_a45/
%G ru
%F PDM_2010_12_a45
R. T. Faizullin. Minimization procedure for Hamiltonian Circuit and Graph Isomorphism problems. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 90-91. http://geodesic.mathdoc.fr/item/PDM_2010_12_a45/