常見(jiàn)例句雙語(yǔ)例句In this paper, Minimum Exact Cover Problem (MECP) for key distribution is presented, and a heuristic solution is testified.本文提出組密鈅分發(fā)的最小準(zhǔn)確覆蓋問(wèn)題，竝証明一種啓發(fā)式的解。An exact algorithm to improve the upper bound of vertex cover and independent set problem for low degree graphs is presented.給出了一種提高低度圖點(diǎn)覆蓋和獨(dú)立集問(wèn)題下界的精確算法。 返回 exact cover problem