dc.contributor.author | Shut, Vasily Nikolaevich | |
dc.contributor.author | Svirsky, V. M. | |
dc.contributor.author | Solomiyuk, K. S. | |
dc.contributor.author | Gryazev, E. V. | |
dc.coverage.spatial | Brest | ru_RU |
dc.date.accessioned | 2023-11-27T08:50:26Z | |
dc.date.available | 2023-11-27T08:50:26Z | |
dc.date.issued | 2006 | |
dc.identifier.citation | 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). | ru_RU |
dc.identifier.uri | https://rep.bstu.by/handle/data/37210 | |
dc.description | Шуть Василий Николаевич, Свирский В. М., Соломиюк К. С., Грязев Е. В. Сопоставление на графах | ru_RU |
dc.description.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. | ru_RU |
dc.language.iso | en | ru_RU |
dc.publisher | BrSTU | ru_RU |
dc.subject | matching | ru_RU |
dc.subject | сопоставление | ru_RU |
dc.subject | graphs | ru_RU |
dc.subject | графики | ru_RU |
dc.subject | trees | ru_RU |
dc.subject | деревья | ru_RU |
dc.title | Matching on Graphs | ru_RU |
dc.title.alternative | Сопоставление на графах | ru_RU |
dc.type | Научный доклад (Working Paper) | ru_RU |