RO  EN
IMCS/Publications/CSJM/Issues/CSJM v.23, n.2 (68), 2015/

Solving Problem of Graph Isomorphism by Hybrid Model

Authors: Alhazov Artiom, Burţeva Liudmila, Cojocaru Svetlana, Colesnicov Alexandru, Malahov Ludmila

Abstract

This work presents the application of new parallelization methods based on membrane-quantum hybrid computing to graph isomorphism problem solving. Applied membrane-quantum hybrid computational model was developed by authors. Massive parallelism of unconventional computing is used to implement classic brute force algorithm efficiently. This approach does not suppose any restrictions of considered graphs types. The estimated performance of the model is less then quadratic that makes a very good result for the problem of NP complexity.

Institute of Mathematics and Computer Science
Str. Academiei 5,
Chisinau, MD-2028,
Moldova
Phone: +373 22 72 59 82 E-mail: , , ,

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Fulltext

Adobe PDF document0.12 Mb