A recurrent algorithm to solve weighted matching problem
Saved in:
| Date: | 2016 |
|---|---|
| Main Authors: | O. B. Matsij, A. V. Morozov, A. V. Panishev |
| Format: | Article |
| Language: | English |
| Published: |
2016
|
| Series: | Cybernetics and Systems Analysis |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000553521 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
Recurrent Method for Solving The Assignment Problem
by: O. B. Matsij, et al.
Published: (2014) -
Fast algorithm to find the 2-factor of minimum weight
by: O. B. Matsij, et al.
Published: (2016) -
The search algorithms of matching for a college admission problem
by: V. M. Horbachuk, et al.
Published: (2015) -
Maximum Matching in Weighted Bipartite Graphs
by: V. M. Kyyko
Published: (2018) -
Maximum Matching in Weighted Bipartite Graphs
by: Kyyko, V.M.
Published: (2018)