graph partition 中文意思是什麼

graph partition 解釋
圖的劃分
  • graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  • partition : n 1 分割；分開；被分開；區分，劃分，配分。2 區分線，區分物，隔開物；隔板，隔墻。3 部分；隔開部分...
  1. Such a partition is called a bipartition of the graph.

    這樣一種分類稱為圖的一個二分類。
  2. It is useful to partition a graph into its components.

    把一個圖分解成它的分支，是很有益的。
  3. Experiments show that the new optimized partition algorithm can improve the parallel simulation performance compared with the ones partitioned by traditional graph partition algorithms

    實驗表明，該優化劃分方法相對于傳統的圖劃分演算法能夠有效地提高模擬性能。
  4. We have studied how to distill a connection matrix between two nodes in a generalized switched network ; using tarjan ’ s graph partition algorithm and nonseparable two - terminal graph concept, we proposed an effective algorithm

    對從廣義開關網路中提取出兩點間連接矩陣的方法進行了研究，利用tarjan的拓撲圖塊劃分演算法、開關網路中的不可分二端圖概念等設計了較有效的演算法。
  5. One of the main problems in pdes is how to partition the network simulation workload to decrease the time needed to complete the simulation and improve performance of simulation. here a new optimized partition algorithm was put forward, which first analyses the performance factors of parallel simulation and then constructs a performance estimation model for partition ; based on this model, it mends the graph partition algorithm to consider all factors, including simulation applications and simulation environments. optimized factors are workload balance 、 communication cost and time window of lookhead

    鑒于基於傳統圖劃分演算法的任務劃分工具存在諸多不足，本文提出了并行網路模擬任務的優化劃分方法，其思想是:首先從pdes機制出發，分析影響并行網路模擬性能的各種因素並建立一個能夠綜合考慮各種因素的并行網路模擬性能估計模型;其次，改進多級圖劃分演算法，使得演算法具有綜合考慮模擬應用與模擬運行環境，同時在優化過程中使用性能估計模型指導劃分，實現對影響并行網路模擬性能的三個因素（包括負載均衡、通信開銷、安全時間窗口長度）的優化能力;最後，結合併行網路模擬性能估計模型與改進的多極圖劃分演算法，實現了并行網路模擬任務的優化劃分。
  6. The basis is hierarchical placement based on the model of directed graph partition. introducing timing - driven placement to clustering, it is an excellent method that mixes the characteristics of timing - driven placement, clustering and directed graph partition. integrated with cdp, this algorithm can solve the system - level vfg problems of electronic devices

    該演算法是基於有向圖分解模型的分級布局演算法，將定時驅動布局思想引入結群過程，是集定時驅動布局、基於結群的布局、基於劃分的布局和有向圖分解思想為一體的快速布局演算法。
  7. It regards a hydraulic component as the basic treatment object or the bond graph model partition unit. according to the common modularization characteristic between hydraulic system and bond graph, the hydraulic component entity class library and its corresponding model description library are established

    在對已有液壓原理圖建模方法比較分析的基礎上，本文完整性地提出了一種基於鍵合圖技術的液壓原理圖可視化建模方法。
  8. Combining one or more parameters of a graph, many papers either present some upper embeddable graphs ~ [ 7 - 14 ] that is to say, they present the graphs, whose maximum genus reaches the best upper bound, or, they give a better low bound on the maximum genus of some graphs ~ [ 15 - 31 ] the first major result of this paper is that : combining vertex partition and degree of vertices of graphs, to study the upper embeddablity of graphs

    結合圖的一個或多個參數，許多文獻都給出了若干上可嵌入圖類，即給出了最大虧格達到最好上界[ （ g ） 2 ]的圖類；或給出一些圖類的最大虧格的較好下界。本文的第一個主要結果，根據圖的頂點劃分和點的度的條件，研究圖的上可嵌入性。
分享友人
分享到 Line

分享到臉書