This paper presents the modeling process of the key covering problem(KCP) in the group rekeying and the transformations between the KCP and the vertex covering problem(VCP) in the graph theory.

 
  • 本文給出了密鑰覆蓋問(wèn)題模型的建立過(guò)程,首次給出密鑰覆蓋問(wèn)題(KCP)與頂點(diǎn)覆蓋問(wèn)題(VCP)的相互變換。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan