independent vertex set

基本解釋

• [數(shù)學(xué)]點(diǎn)無(wú)關(guān)集

英漢例句

雙語(yǔ)例句

• 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)題下界的精確算法。

• independent vertex set更多例句

詞組短語(yǔ)

短語(yǔ)

• independent vertex -set 獨(dú)立點(diǎn)集
• vertex independent set 點(diǎn)獨(dú)立集

• independent vertex set更多詞組

專業(yè)釋義

數(shù)學(xué)

• 點(diǎn)無(wú)關(guān)集