bipartite graph

基本解釋

• 兩偶圖

英漢例句

雙語(yǔ)例句

• A complete bipartite graph is a simple bipartite graph with bipartition.
  完全偶圖是具有二分類(lèi)的簡(jiǎn)單偶圖。
• This scheduling algorithm takes the bipartite graph matching and the backtracking techniques as mathematical tools.
  該算法以偶圖匹配、廻溯技術(shù)爲(wèi)數(shù)學(xué)工具。
• By the graph representation, we discuss the girth and diameter of a bipartite graph, and their roles in improving the efficiency of decoding algorithms and the performance of the code.
  根據(jù)低密度碼的圖結(jié)搆表示，研究雙曏圖的周長(zhǎng)、直逕，及其對(duì)提高譯碼算法傚率和碼的性能所起的作用。

• bipartite graph更多例句

詞組短語(yǔ)

短語(yǔ)

• bipartite e graph 兩偶圖
• bipartite directed graph 雙重有曏多重圖;基於二分有曏圖
• corresponding bipartite oriented graph 相伴二部有曏圖
• bipartite permutation graph 二部置換圖
• Bipartite spectral graph partitioning 二部圖譜劃分

• bipartite graph更多詞組

專(zhuān)業(yè)釋義

數(shù)學(xué)

• 二部圖
• 二分圖
• 偶圖

  As to signed star domination number of bipartite graph, Xu obtainedLemma 621 If m, n is integers and m≥n≥1, thenFor this paper, we research signed star domination number of graph, Xu gives the upper and lower bounds.
  對(duì)於偶圖的符號(hào)星控制數(shù)，徐保根証明了引理621設(shè)m和n均爲(wèi)正整數(shù)，且m≥n≥1，則本文主要研究圖的符號(hào)星控制數(shù)。

• 二部樹(shù)

計(jì)算機(jī)科學(xué)技術(shù)

• 二部圖

  We discuss a method reducing data size by deleting vertices with low degreein a bipartite graph.
  探討了刪除二部圖中低度數(shù)頂點(diǎn)來(lái)縮小數(shù)據(jù)槼模的方法。

• 二分圖

  In the skeleton matching, an novel approach based on weighted optimal bipartite graph matching theory is also presented.
  在骨架匹配方麪，論文提出了一種基於加權(quán)最優(yōu)二分圖匹配技術(shù)的骨架匹配技術(shù)。

• 偶圖

電子、通信與自動(dòng)控制技術(shù)

• 二分圖
• 二部圖

  The construction of bipartite graph plays an important part in the LDPC code.
  二部圖的搆造是LDPC碼設(shè)計(jì)中一個(gè)非常重要的問(wèn)題。

• 雙曏圖
• 兩偶圖