Functional approach to the Hamiltonian circuit and graph isomorphism problems

DOI10.1007/S10958-010-9999-5MaRDI QIDQ2452948zbMATH OpenOpenAlexFDO

Authors R. T. Faizullin

Publication date 6 June 2014

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-010-9999-5

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Minimization procedure for Hamiltonian circuit and graph isomorphism problems
• Graph-theoretic algorithms for the ``isomorphism of polynomials problem
• Minimization of functionals associated with problems of cryptographic analysis of asymmetric ciphers.
• Some recognition problems related to graph isomorphism
• Computing complete graph isomorphisms and Hamiltonian cycles from partial ones

Cites work

• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Cited in

(3)

• scientific article; zbMATH DE number 4068311 (Why is no real title available?)
• Minimization procedure for Hamiltonian circuit and graph isomorphism problems
• Minimization of functionals associated with problems of cryptographic analysis of asymmetric ciphers.

This page was built for publication: Functional approach to the Hamiltonian circuit and graph isomorphism problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452948)