|
關注:1
2013-05-23 12:21
求翻譯:k ≥ 10, k-STC is NP-complete for simple unweighted graphs with only one vertex of unbounded是什么意思?![]() ![]() k ≥ 10, k-STC is NP-complete for simple unweighted graphs with only one vertex of unbounded
問題補充: |
湖北省互聯網違法和不良信息舉報平臺 | 網上有害信息舉報專區 | 電信詐騙舉報專區 | 涉歷史虛無主義有害信息舉報專區 | 涉企侵權舉報專區