Будь ласка, використовуйте цей ідентифікатор, щоб цитувати або посилатися на цей матеріал: http://lib.kart.edu.ua/handle/123456789/13093
Повний запис метаданих
Поле DCЗначенняМова
dc.contributor.authorListrovoy, S. V.-
dc.contributor.authorGolovko, O. V.-
dc.contributor.authorButenko, V. M.-
dc.contributor.authorUshakov, M. V.-
dc.date.accessioned2022-12-27T08:48:57Z-
dc.date.available2022-12-27T08:48:57Z-
dc.date.issued2018-
dc.identifier.citationListrovoy S.V. Formulation of the Problem of Maximum Clique Determination in Non-Oriented Graphs / S. V. Listrovoy, O. V. Golovko, V. M. Butenko, M. V. Ushakov // International Journal of Engineering and Technology. - 2018. - № 7 (4.3). - Р. 293-297.uk_UA
dc.identifier.issn2319-8613-
dc.identifier.urihttp://lib.kart.edu.ua/handle/123456789/13093-
dc.description.abstractIn the train traffic organization, large amount of information should be processed in real time. Thereby in complicated dispatching systems, rational use of resources is needed. To perform this work a model of a management system is constructed and it is represented as a sparse graph. Further optimization of the model requires solving the Maximum Clique Problem (MCP) for the less time than the exponential time. This article contains two procedures for solving the task for subexponential time. Procedure B accurately estimates the size of the maximum clique in the graph and performs the sorting of the vertices, in such a way that the vertices that are not exactly in the maximum clique can be rejected. Procedure A, in fact, finds cliques of the maximum size in a given graph, using the procedure B. The main advantage of this method is that using it is expedient in real time for sufficiently large graphs, which in turn is important for the construction of control systems.uk_UA
dc.language.isoenuk_UA
dc.publisherEngg Journals Publicationsuk_UA
dc.subjectcliques in non-oriented graphuk_UA
dc.subjectcost optimization toolsuk_UA
dc.subjectmaximum clique problemuk_UA
dc.subjectrailway infrastructurеuk_UA
dc.subjectsafety of control systemsuk_UA
dc.titleFormulation of the Problem of Maximum Clique Determination in Non-Oriented Graphsuk_UA
dc.typeArticleuk_UA
Розташовується у зібраннях:2018

Файли цього матеріалу:
Файл Опис РозмірФормат 
Listrovoy.pdf395.99 kBAdobe PDFПереглянути/Відкрити


Усі матеріали в архіві електронних ресурсів захищені авторським правом, всі права збережені.