Authors: Thinh D. Nguyen
The study of perebor dates back to the Soviet-era mathematics, especially in the 1980s . Post-Soviet mathematicians has been working on many problems in combinatorial optimization. One of them is Exact Weight Perfect Matching of Bipartite Graph (EWPM).This particular problem has been thoroughly considered by , , . In this note, we give a simpler proof about the solvability of EWPM.
Comments: 2 Pages.
[v1] 2018-06-14 03:30:42
Unique-IP document downloads: 0 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.