A minimumweight perfect matching problem is to find a perfect matching that ... It is obvious that a minimum-weight perfect matching in an affinity graph ...
確定! 回上一頁