In this lecture, we will describe a strongly polynomial time algorithm for the minimum cost perfect matching problem in a general graph.
確定! 回上一頁