Search
Matching on Graphs
View/ Open document files
Date
2006Publisher
BrSTUCitation
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).Abstract
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.
Collection
Это произведение доступно по лицензии Creative Commons «Attribution-NonCommercial» («Атрибуция-Некоммерчески») 4.0 Всемирная.