On the other hand, it is shown in [22] that the restricted perfect matching problem is polynomial when G is a complete bipartite graph and k = 2 ...
確定! 回上一頁