Computational Methods in Discrete Mathematics

Minimization procedure for Hamiltonian Circuit and Graph Isomorphism problems

R. T. Faizullin

Omsk State Technical University, Omsk

Abstract: 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.

UDC: 519.178