Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika, 2010, supplement № 3, Pages 90–91 (Mi pdm194)  
Computational Methods in Discrete Mathematics

Minimization procedure for Hamiltonian Circuit and Graph Isomorphism problems

R. T. Faizullin

Omsk State Technical University, Omsk
Full-text PDF (238 kB)
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.
Document Type: Article
UDC: 519.178
Language: Russian
Citation: R. T. Faizullin, “Minimization procedure for Hamiltonian Circuit and Graph Isomorphism problems”, Prikl. Diskr. Mat., 2010, supplement № 3, 90–91
Citation in format AMSBIB
\Bibitem{Fai10}
\by R.~T.~Faizullin
\paper Minimization procedure for Hamiltonian Circuit and Graph Isomorphism problems
\jour Prikl. Diskr. Mat.
\yr 2010
\pages 90--91
\issueinfo supplement № 3
\mathnet{http://mi.mathnet.ru/pdm194}
Linking options:
  • https://www.mathnet.ru/eng/pdm194
  • https://www.mathnet.ru/eng/pdm/y2010/i12/p90
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:203
    Full-text PDF :79
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024