您要查找的是不是:
- A tree is a connected graph with no cycles. 一個(gè)樹(shù)是一個(gè)沒(méi)有圈的連通圖。
- Let G=(V,E)be a simple connected graph,and dv be the degree of vertex v. 圖G=(V,E)為簡(jiǎn)單連通圖,dv表示頂點(diǎn)v的度。
- An articulation point is a vertex of a connected graph which can be split to yield an unconnected graph. 如果一個(gè)連通圖的一個(gè)頂點(diǎn)能被分割,從而使這圖成為一個(gè)不連通圖,則這個(gè)頂點(diǎn)稱(chēng)為斷點(diǎn)。
- Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph. 摘要本文中引進(jìn)了連通圖的森林圖,它是樹(shù)圖的推廣。
- A noncomplete6 connected graph is called contraction-critical if it has no any6- contractible edge. 一個(gè)不包含6可收縮邊的非完全圖被稱(chēng)為收縮臨界6連通圖.
- The critical group of a connected graph is a finite abelian group whose structure is a subtle isomorphism invariant of the graph. 圖的臨界群是圖生成樹(shù)數目的一個(gè)加細.;它是定義在圖上的一個(gè)有限交換群;其群結構是圖的一個(gè)精細不變量;與圖的Laplacian理論密切相關(guān)
- According to the judging theory of Euler entry (or circuit) in undirected connected graph, the algorithm and program of computer solution are decided. 根據無(wú)向連通圖中歐拉通路或歐拉回路的判定定理,給出計算機求解的算法和程序。
- Solder it to the inner conductor of your Type N connector (see photo). 用焊錫把它和N連接器的導體焊接起來(lái)(見(jiàn)照片)。
- An undirected connected graph with no cycles is called a tree. A vertex with degree equal to one in a tree is called a leaf. 一個(gè)無(wú)環(huán)無(wú)向連通圖稱(chēng)為一棵樹(shù)。樹(shù)中一個(gè)度為一的點(diǎn)稱(chēng)為葉子結點(diǎn)。
- A weighted path algorithm and a connected graph algorithm were developed to automatically find multicasting faults in large multicasting networks. 在此基礎上,提出兩種故障定位算法,即基于經(jīng)驗的路徑加權法和基于圖論的連通圖算法。
- Let G be a connected graph, its quasi-Laplacian matrix is Q (G) =D (G) +A (G), where D (G) is the diagonal matrix of its vertex degrees and A (G) is its adjacency matrix. 摘要對于連通圖G,矩陣Q(G)=D(G)+A(G)稱(chēng)為圖G的擬拉普拉斯矩陣,其中D(G)為圖的度對角矩陣,A(G)為圖的鄰接矩陣。
- We use a vectorization algorithm to extract form lines from run-length connect graph which is calculated first,and in the same time the skew angle is detected. 先使用一種矢量化的直線(xiàn)提取算法在游程連通圖的基礎上得到表格線(xiàn),同時(shí)對表格進(jìn)行傾斜校正。
- There is quadruplet to input terminal on 5790A, two groups of N connector mixes two groups but column of wiring of 5 means connective. 在5790A上有四組輸入端子,兩組N型連貫器和兩組可5體例連貫的接線(xiàn)柱。
- G is a minimal connected graph. G是一個(gè)極小連通圖。
- This paper gives the definition of subassembly, and presents a space partition technique using octree to get connection graph and local blocking graph. 給出了子裝配體的定義,提出使用八叉樹(shù)分割空間來(lái)獲得聯(lián)接圖和局部阻礙圖的方法。
- The topological sorting algorithm works on unconnected graphs as well as connected graphs. 拓撲排序算法既可以用于連通圖,也可以用于非連通圖。
- We use octree to decompose our scene and improve the efficiency through decomposing model, decreasing nodes count in connectivity graph, avoiding collision test etc. 本文利用八叉樹(shù)來(lái)描述場(chǎng)景,通過(guò)簡(jiǎn)化模型、減少連接圖節點(diǎn)數、避免碰撞檢測等方式提高路徑規劃的效率。
- To resolve directed cutset of Directed Assembly Connection Graph(DACG),an efficient algorithm for the enumeration of all directed cutsets of DACG was presented. 為解決有向裝配圖有向割集的求解,給出一個(gè)生成有向裝配連接圖有向割集的高效算法,該算法優(yōu)先考慮檢查有向割集兩個(gè)子圖間邊的方向。
- Lower Bounds on Maximum Genus of a Connected Graph 關(guān)于圖的最大虧格的下界
- kernel of strongly connected graph 有向強連通圖的核