Поиск по всему репозиторию:
Matching on Graphs
Открыть/скачать файлы документа
Дата издания
2006Издательство
BrSTUБиблиографическое описание
Matching on Graphs / V. N Shut [et al,] // International Conference on Neural Networks and Artificial Intelligence : proceedings, Brest, 31 May – 2 June, 2006 / Edited: V. Golovko [et al.]. – Brest : BSTU, 2006. – P. 119–123 : il. – Bibliogr.: p. 123 (8 titles).Аннотация
This work is devoted to development of new algorithm of the decision of a matter about matching. In the result the algorithm of search maximal matching in graphs has been developed and realized, the estimation of its complexity, and comparison with existing algorithms have been made. Its characteristics, merits and demerits have been investigated too.
URI документа
https://rep.bstu.by/handle/data/37210Документ расположен в коллекции
Это произведение доступно по лицензии Creative Commons «Attribution-NonCommercial» («Атрибуция-Некоммерчески») 4.0 Всемирная.