Abstract
The work contains the results of studies to improve the well-known algorithms for finding maximum matching with a minimum total weight of edges. A new permutation-matrix model of optimal assignment is proposed, which provides the possibility of recursively finding solutions on the set of magnifying paths constructed relative to the current matching. Figs.: 4. Refs.: 10 titles. Keywords : algorithm; matching; optimal purpose; magnifying path; permutation-matrix model.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of the National Technical University "KhPI" A series of "Information and Modeling"
Paper Title
Journal
Date
