GRAPH-SUBGRAPH ISOMORPHISM PROBLEM SOLVING FOR DESIGNING SPECIAL COMPUTERS

Authors

  • M.B. Il’yashenko Zaporizhzhia National Technical University, Ukraine
  • A.A. Goldobin Zaporizhzhia National Technical University, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2012-1-6

Keywords:

declarative logic, predicate, O-Tree, Prolog, recursively returning, graph-subgraph isomorphism.

Abstract

An advanced algorithm for solving graphs isomorphism problem is proposed and experimental results of its efficiency are presented. Object of investigation is set of control flow graphs of solutions achieved, that were received after circumvent of the semantic network by Warren abstract machine.

Downloads

Published

2012-07-10

How to Cite

Il’yashenko, M., & Goldobin, A. (2012). GRAPH-SUBGRAPH ISOMORPHISM PROBLEM SOLVING FOR DESIGNING SPECIAL COMPUTERS. Radio Electronics, Computer Science, Control, (1). https://doi.org/10.15588/1607-3274-2012-1-6

Issue

No. 1 (2012): Radio Electronics, Computer Science, Control

Section

Mathematical and computer modelling

License

Copyright (c) 2014 M.B. Il’yashenko, A.A. Goldobin

Creative Commons License

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

Creative Commons Licensing Notifications in the Copyright Notices

The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.

The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.

The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.