您要查找的是不是:
- Minimum Weight Vertex Covering Set and Maximum Weight Vertex Independent Set in a Bipartite Graph. 二分圖的最小點(diǎn)權覆蓋集與最大點(diǎn)權獨立集。
- Maximum weight vertex independent set, MaxWVIS 最大點(diǎn)權獨立集
- Based on root tree and Maximal Weighted Independent Set, EACT utilizes periodical rotation of cluster heads to balance the energy consumed by nodes. 算法引入了圖論中極大權極大獨立集和根樹(shù)的概念,并借助簇頭輪換機制均衡節點(diǎn)消耗。
- Could you tell me what the maximum weight allowance is? 您能告訴我行李的最大重量限額是多少嗎?
- What is the maximum weight allowed? 重量的限額是多少呢?
- What's the maximum weight allowed? 重量最高限額是多少?
- Each row represents an independent set of criteria. 其中每一行都代表一個(gè)獨立的條件集。
- The maximum weight when full is 5.5 Kg. 最高運載量為5.;5千克。
- What 's the maximum weight allow? 最高重量限額是多少?
- Whats the maximum weight allowed? 最高重量限額是多少?
- This paper shows by counterexamples that the algorithms of finding maximum independent set and minimum dominating set of a graph in [1] are wrong. 用反例證明了文[1]中的最大獨立集算法和最小支配集算法的結論都是錯誤的,因而圖論中獨立支配集的求解問(wèn)題并沒(méi)有解決.
- The maximum weight allowance is 60 kilos per traveler, excluding hand luggage. 每個(gè)旅客托運的行李最大重量限額是60公斤,手提行李除外。
- Three independent sets of shortcuts. 三個(gè)獨立的兩套捷徑。
- The maximum weight allowance is 60 kilos per traveler,excluding hand luggage. 每個(gè)旅客托運的行李最大重量限額是60千克。
- What is the maximum weight of hand luggage that I can take aboard the plane? 我最多可以帶多重的行李上飛機?
- A system that can uniquely represent any unit which can be composed from a linearly independent set of base units. 對于可以分解為一組線(xiàn)性無(wú)關(guān)的基礎單位的單位可以惟一表示的系統。
- The maximum weight allowance is 60 koli per traveler, excluding hand lugguage. 每個(gè)旅客托運的行李最大重量限額是60公斤,手提行李除外。
- The maximum weight allowance is 60 kilos per traveler, excluding handluggage. 每個(gè)旅客托運的行李最大重量限額是60公斤,手提行李除外。
- Using this condition ,the available algorithms about themaximal independent set in the bipartite and non-bipartite network aregiven. 研究表明,負包絡(luò )圖也是關(guān)于網(wǎng)絡(luò )最大獨立集的充要條件。