GRAPH-SUBGRAPH ISOMORPHISM PROBLEM SOLVING FOR ORGANIZATION RESOURCES DISTRIBUTION

Authors

  • M. Ilyashenko Zaporizhzhya National Technical University, Ukraine, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2014-1-8

Keywords:

resources reservation, graph-subgraph isomorphism, weighted graphs, labeled graphs, graph-analytical approach

Abstract

The paper presents graph-analytical approach for organizations resources distribution. It based on graph-subgraph isomorphism algorithm for weighted and labeled graphs and can be considered as development of graph-subgraph isomorphism algorithm for weighted graphs proposed before. Paper describes requirements and specifics of human and technical resources reservation in modern distributed organizations, that can have rather complicated structure, taking into account relations between available resources, and specifics of requirements in resources provided by complicated tasks that need to be solved by organizations. All types of resources considered as weighted and labeled graphs. Next presented advanced version of graph-subgraph isomorphism algorithm enhanced to work with graphs both weighted and labeled by vertexes. Provided full set of preliminary conditions aim to narrow main combinatorial part of algorithm, where branch and bound method used to find final substitution.

References

Haijun, Zhang. Research on co-reservation in the manufacturing grid system / Haijun Zhang, Yefa Hu, Zude Zhou // The International Journal of Advanced Manufacturing Technology. – 2010. – Volume 47, Issue 5–8. – P. 699–717.

Christoph, Langguth. Optimizing resource allocation for scientific workflows using advance reservations / Christoph Langguth, Heiko Schuldt // Proceeding SSDBM’10 Proceedings of the 22nd international conference on Scientific and statistical database management. – Springer-Verlag. – 2010. – P. 434–451.

Ильяшенко, М. Б. Алгоритм нахождения графподграф изоморфизма для взвешенных графов и его применение / Ильяшенко М. Б. // Радиоэлектроника, информатика, управление. – 2007. – № 1. – С. 62–68.

Ильяшенко, М. Б. Разработка и исследование параллельного алгоритма проверки граф-подграф изоморфизма / Ильяшенко М. Б. // Радиоэлектроника, информатика, управление. – 2006. – № 1. – С. 63–69.

Пинчук, В. П. Распознование изоморфности графов: ПНВ-алгоритм / В. П. Пинчук // Складні системи і процеси. – 2002. – № 1. – С. 4–11.

Пинчук, В. П. Основанная на волновом разложении система инвариантов для простых графов и алгоритм распознавания изоморфности / В. П. Пинчук // Киев, 1995. – Деп. в ГНТБ Украины 10.05.95, N 1002 – Ук 95.

Downloads

Published

2014-03-25

How to Cite

Ilyashenko, M. (2014). GRAPH-SUBGRAPH ISOMORPHISM PROBLEM SOLVING FOR ORGANIZATION RESOURCES DISTRIBUTION. Radio Electronics, Computer Science, Control, (1). https://doi.org/10.15588/1607-3274-2014-1-8

Issue

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

Section

Mathematical and computer modelling

License

Copyright (c) 2014 M. Ilyashenko

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.