Solving problem of graph isomorphism by membrane-quantum hybrid model

MaRDI QIDQ1650334zbMATH OpenFDO

Authors Artiom Alhazov, Lyudmila Burtseva, Svetlana Cojocaru, Alexandru Colesnicov, Ludmila Malahov

Publication date 3 July 2018

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL http://www.math.md/publications/csjm/issues/v23-n2/11967/

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Solving problems in various domains by hybrid models of high performance computations
• A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
• A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
• An enhanced classical approach to graph isomorphism using continuous-time quantum walk
• P system computational model as framework for hybrid (membrane-quantum) computations

Cited in

(1)

• Parallel Algorithm for Solving the Graph Isomorphism Problem

This page was built for publication: Solving problem of graph isomorphism by membrane-quantum hybrid model

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