Maximum Matching in Weighted Bipartite Graphs
The purpose of the article is to consider a new task setting and algorithms for maximum matching in weighted bipartite graphs as well as using these algorithms in fingerprint recognition. Methods. Modified versions of finding maximum matching M in graph by searching and augmentation of M-augmenting...
Saved in:
| Published in: | Кибернетика и вычислительная техника |
|---|---|
| Date: | 2018 |
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Міжнародний науково-навчальний центр інформаційних технологій і систем НАН України та МОН України
2018
|
| Subjects: | |
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/131936 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Maximum Matching in Weighted Bipartite Graphs / V.M. Kyyko // Кибернетика и вычисл. техника. — 2018. — № 1 (191). — С. 32-44. — Бібліогр.: 17 назв. — англ. |