您要查找的是不是：
- Abstract ：Bipartite graph is a special model in the Graph Theory. 摘 要 ：偶圖是圖論中的一種特殊模型。
- If |V(G)| is even, then G is either an elementary bipartite graph or a brick. 如果 |V(G) |為偶數 ;則 G或者是一個(gè)基本的二部圖 ;或者是一個(gè)磚塊 .
- Minimum Weight Vertex Covering Set and Maximum Weight Vertex Independent Set in a Bipartite Graph. 二分圖的最小點(diǎn)權覆蓋集與最大點(diǎn)權獨立集。
- Partition,Subgraph,Degree sum,Maximum degree,Bipartite graph,Vertex-disjoint,Cycles,Paths. 剖分;子圖;度和;最大度;二部圖;頂點(diǎn)不交;圈;路.
- Inthis method,a bipartite graph structure is used to track potentially intersecting faces. 該方法主要是利用二部圖跟蹤兩個(gè)細分曲面中可能相交的面。
- An algorithm for finding all perfect matchings in a given bipartite graph G(X,Y, E) is presented. 本文提出了一種求解這一問(wèn)題的算法。
- The gracefulness of graceful bipartite graph joining path was discussed and the same amalgamated product of the graph was also discussed. 文章討論了優(yōu)美二部圖粘接路所得圖的優(yōu)美性以及這類(lèi)圖的一種混合積的優(yōu)美性。
- The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints. MSS 問(wèn)題的目標，是在一個(gè)二分無(wú)向圖上尋找由互不相交的路徑所構成的集合，并要求這個(gè)集合滿(mǎn)足一些特定的條件。
- A complete bipartite graph is a simple bipartite graph with bipartition. 完全偶圖是具有二分類(lèi)的簡(jiǎn)單偶圖。
- G is said to be bipartite matching extendable (BM-extendable) if every matching M whose induced subgraph is a bipartite graph extends to a perfect matching of G. 稱(chēng)G是偶匹配可擴的，如果G中導出子圖是偶圖的匹配對都可以擴充為G的完美匹配。
- Number1covert to find the minimum matching matroid of bipartite graph,and number2to search for one matching of permeating musters through bipartite graph. 第一個(gè)問(wèn)題轉化為求二部圖最小匹配數,第二個(gè)問(wèn)題轉化為求二部圖中滲透集合每個(gè)點(diǎn)的一個(gè)匹配。
- Finding all perfect matchings in a given bipartite graph has importantapplications to the global routing and channel ordering for VLSI building block layout. 求給定偶圖的所有完備匹配問(wèn)題在LSI/VLSI的布圖設計方面有著(zhù)重要的應用。
- In this paper, the algorithm is introduced on using bipartite graph to build mathematical model and to solve division between teachers and classes in the design of arranging lessons system. 介紹在進(jìn)行排課系統設計時(shí),利用二部圖結構構造數學(xué)模型、解決教師和班級分組問(wèn)題的算法。
- In this paper, the algorithm is introduced on using bipartite graph to build mathematical model and to solve division between teachers and classes in the design of arranging-lessons system. 摘要介紹在進(jìn)行排課系統設計時(shí)，利用二部圖結構構造數學(xué)模型、解決教師和班級分組問(wèn)題的算法。
- have implication for 對…有啟示，對…有借鑒
- Based on duality theory of linear programming and graph theory, it is proved that the matching game defined on a bipartite graph has the stable core if and only if the graph has a perfect matching. 基于線(xiàn)性規劃對偶理論和圖論的相關(guān)知識，我們首先證明了匹配對策有穩定核心當且僅當其基礎二部圖有完美匹配。
- Much effort has been spent on investigating the crossing numbers of complete graphs, complete bipartite graphs and cartesian products graphs. 大多的努力是在探求完全圖，完全二部圖及笛卡爾積圖的交叉數。
- ON 2- FACTORS OF A BIPARTITE GRAPH 關(guān)于二分圖的2-因子
- Bipartite graphs with P-regular endomorphism monoids are characterized.P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed. 刻劃了具有P-正則自同態(tài)幺半群的二分圖，討論了字典序積圖的自同態(tài)幺半群的P-正則性.
- Abstract： Bipartite graphs with P-regular endomorphism monoids are characterized.P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed. 摘要 ：刻劃了具有P-正則自同態(tài)幺半群的二分圖，討論了字典序積圖的自同態(tài)幺半群的P-正則性.
