Solving Problem of Graph Isomorphism by Membrane-Quantum Hybrid Model
Închide
Articolul precedent
Articolul urmator
675 5
Ultima descărcare din IBN:
2023-05-10 17:06
SM ISO690:2012
ALHAZOV, Artiom, BURTSEVA, Lyudmila, COJOCARU, Svetlana, COLESNICOV, Alexandru, MALAHOV, Ludmila. Solving Problem of Graph Isomorphism by Membrane-Quantum Hybrid Model. In: Workshop on Foundations of Informatics, 24-29 august 2015, Chisinau. Chișinău, Republica Moldova: "VALINEX" SRL, 2015, I, pp. 89-100. ISBN 978-9975-4237-3-1.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Workshop on Foundations of Informatics
I, 2015
Conferința "Workshop on Foundations of Informatics"
Chisinau, Moldova, 24-29 august 2015

Solving Problem of Graph Isomorphism by Membrane-Quantum Hybrid Model

Pag. 89-100

Alhazov Artiom, Burtseva Lyudmila, Cojocaru Svetlana, Colesnicov Alexandru, Malahov Ludmila
 
Institute of Mathematics and Computer Science ASM
 
 
Disponibil în IBN: 3 octombrie 2017


Rezumat

This work presents the application of new parallelization methods based on membrane-quantum hybrid computing to graph isomorphismproblem 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.