Поиск по всему репозиторию:

Показать краткое описание

dc.contributor.authorShut, Vasily Nikolaevich
dc.contributor.authorSvirsky, V. M.
dc.contributor.authorSolomiyuk, K. S.
dc.contributor.authorGryazev, E. V.
dc.coverage.spatialBrestru_RU
dc.date.accessioned2023-11-27T08:50:26Z
dc.date.available2023-11-27T08:50:26Z
dc.date.issued2006
dc.identifier.citationMatching 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).ru_RU
dc.identifier.urihttps://rep.bstu.by/handle/data/37210
dc.descriptionШуть Василий Николаевич, Свирский В. М., Соломиюк К. С., Грязев Е. В. Сопоставление на графахru_RU
dc.description.abstractThis 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.ru_RU
dc.language.isoenru_RU
dc.publisherBrSTUru_RU
dc.subjectmatchingru_RU
dc.subjectсопоставлениеru_RU
dc.subjectgraphsru_RU
dc.subjectграфикиru_RU
dc.subjecttreesru_RU
dc.subjectдеревьяru_RU
dc.titleMatching on Graphsru_RU
dc.title.alternativeСопоставление на графахru_RU
dc.typeНаучный доклад (Working Paper)ru_RU


Файлы в этом документе

Thumbnail

Данный элемент включен в следующие коллекции

Показать краткое описание