Solving Problem of Graph Isomorphism by Membrane-Quantum Hybrid Model

被引：0
|
作者：
Alhazov, Artiom [1 ]
Burtseva, Lyudmila [1 ]
Cojocaru, Svetlana [1 ]
Colesnicov, Alexandru [1 ]
Malahov, Ludmila [1 ]
机构：
[1] Inst Math & Comp Sci, Str Acad 5, MD-2028 Kishinev, Moldova
来源：
COMPUTER SCIENCE JOURNAL OF MOLDOVA | 2015年 / 23卷 / 02期
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：237 / 248
页数：12
相关论文
共 50 条
  • [1] Solving the graph-isomorphism problem with a quantum annealer
    Hen, Itay
    Young, A. P.
    PHYSICAL REVIEW A, 2012, 86 (04):
  • [2] P system computational model as framework for hybrid (Membrane-Quantum) computations
    Rogozhin, Yurii
    Alhazov, Artiom
    Burtseva, Lyudmila
    Cojocaru, Svetlana
    Colesnicov, Alexandru
    Malahov, Ludmila
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8961 : 373 - 384
  • [3] P System Computational Model as Framework for Hybrid (Membrane-Quantum) Computations
    Rogozhin, Yurii
    Alhazov, Artiom
    Burtseva, Lyudmila
    Cojocaru, Svetlana
    Colesnicov, Alexandru
    Malahov, Ludmila
    MEMBRANE COMPUTING (CMC 2014), 2014, 8961 : 373 - 384
  • [4] Parallel Algorithm for Solving the Graph Isomorphism Problem
    V. V. Vasilchikov
    Automatic Control and Computer Sciences, 2021, 55 : 617 - 622
  • [5] Parallel Algorithm for Solving the Graph Isomorphism Problem
    Vasilchikov, V. V.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2021, 55 (07) : 617 - 622
  • [6] Quantum invariants and the graph isomorphism problem
    Mills, P. W.
    Rundle, R. P.
    Samson, J. H.
    Devitt, Simon J.
    Tilma, Todd
    Dwyer, V. M.
    Everitt, Mark J.
    PHYSICAL REVIEW A, 2019, 100 (05)
  • [7] A Quantum Algorithm for the Sub-graph Isomorphism Problem
    Mariella, Nicola
    Simonetto, Andrea
    ACM TRANSACTIONS ON QUANTUM COMPUTING, 2023, 4 (02):
  • [8] A generalization of the Hopfield model for the graph isomorphism problem
    Galan-Marin, Gloria
    Lopez-Rodriguez, Domingo
    Merida-Casermeiro, Enrique
    COMPUTING AND COMPUTATIONAL TECHNIQUES IN SCIENCES, 2008, : 98 - +
  • [9] The Graph Isomorphism Problem
    Grohe, Martin
    Schweitzer, Pascal
    COMMUNICATIONS OF THE ACM, 2020, 63 (11) : 128 - 134
  • [10] GRAPH-SUBGRAPH ISOMORPHISM PROBLEM SOLVING FOR DESIGNING SPECIAL COMPUTERS
    Il'yashenko, M. B.
    Goldobin, A. A.
    RADIO ELECTRONICS COMPUTER SCIENCE CONTROL, 2012, 1 : 31 - 36
12345