Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
913 8 |
Ultima descărcare din IBN: 2018-09-13 09:46 |
Căutarea după subiecte similare conform CZU |
004.421.1:519.17 (1) |
Programe. Software (296) |
Analiză combinatorică. Teoria grafurilor (115) |
SM ISO690:2012 ALHAZOV, Artiom, BURTSEVA, Lyudmila, COJOCARU, Svetlana, COLESNICOV, Alexandru, MALAHOV, Ludmila. Solving Problem of Graph Isomorphism by Hybrid Model. In: Computer Science Journal of Moldova, 2015, nr. 2(68), pp. 237-248. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 2(68) / 2015 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 004.421.1:519.17 | ||||||
Pag. 237-248 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
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. |
||||||
|