bipartite graph 中文意思是什麼

bipartite graph 解釋
二部圖
  • bipartite : adj. 1. 由兩部分構成的。2. 【法律】一式兩份的；（條約等）兩方之間的。3. 【植物；植物學】有二深裂的（葉子等）。4. 【數學】除兩次的。
  • graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. A graph is bipartite if it does not contain an odd cycle.

    一個圖是二部圖，如果它不包含奇圈。
  2. A complete bipartite graph is a simple bipartite graph with bipartition.

    完全偶圖是具有二分類的簡單偶圖。
  3. If enough edges have been drawn to make the figure connected the graph is called bipartite.

    如果有足夠的線使圖連通，這圖稱為雙圖。
  4. The matrix algorithm of search a maximum matching in bipartite graph

    求偶圖最大匹配的矩陣演算法
  5. 2 there is also a new result on two bipartite graphs. let h be a graph obtained from km and kn by joining them with a bridge, and m > n > a > b, then r ( kab, h ) < max { r ( ka ? km ), r ( ka4, kn ) + m }

    另外對完全二部圖的ramsey數進行研究，給山一個結論： h是在k _ m和k _ n之間連接一個橋得到的， m n b 。
  6. 4. when solving the tna problem based on minimum fleet requirement, a bipartite graph describing flight - pairing - link property is constructed, by which the primary problem is transferred to two weighted bipartite matching

    在解決最少需用飛機數要求的飛機排班問題時，本文將尋找航班節銜接方案問題，描述成一個二部圖的匹配問題，進而通過解兩個二部圖的最小權最大匹配，尋找需用飛機數最少的飛機調度方案。
  7. Taking attributed scattering center - based classification as example, the computation of feature likelihood function under many - many and 1 - 1 correspondence are studied, by using the algorithm of bipartite graph perfect matching to find the optimal 1 - 1 correspondence, the computation efficiency is improved greatly, the relations of likelihood function between 1 - 1 and many - many correspondence are analyzed, and two sub - optimal methods of calculating the likelihood function of 1 - 1 correspondence are presented

    本章以基於屬性散射中心特徵的分類為例，深入研究了多?多對應和1 ? 1對應特徵似然函數的計算，通過將求解二分圖最佳匹配的演算法用於尋找特徵之間的最優1 ? 1對應關系，有效提高了1 ? 1對應特徵似然函數的計算效率，分析了1 ? 1對應和多?多對應特徵似然函數之間的關系，給出了兩種次優的1 ? 1對應特徵似然函數計算方法。
  8. In the skeleton matching, an novel approach based on weighted optimal bipartite graph matching theory is also presented

    在骨架匹配方面，論文提出了一種基於加權最優二分圖匹配技術的骨架匹配技術。
  9. It is easy to see that every semisymmetric graph is necessarily bipartite, with the two parts having equal size and che automorphism group acting transitively on each of these two parts

    顯然，半對稱圖是兩分圖，並且兩部分的階相同，自同構群在這兩部分上的作用是傳遞的。
分享友人
分享到 Line

分享到臉書