您要查找的是不是:
- Finding a Maximum Density Subgraph. 最大密度子圖。
- We call such a spanning subgraph T an economical spanning subgraph. 我們稱這樣的生成子圖T為廉價的生成子圖。
- Second, we find a dense subgraph based on the greedy algorithm. 在第二個步驟,我們利用貪婪演演算法找到一個密集的子網路;
- GString can also facilitate similarity subgraph search. GString也能很方便地支持相似子圖搜索問題。
- All you need to do is create your text in a subgraph. 你所要做的是將你的文字創建在一個子圖中。
- These questions are special cases of the so called forbidden subgraph problem. 這些問題都是所謂禁用子圖問題的特殊情形。
- Finally, we repeat the above phases until no more dense subgraph can be found. 在最後一個步驟,我們重複第一到第三步驟直到我們找不出任何密集的子網路為止。
- The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory. 禁向子圖問題是圖論中相當大的一類極值問題中的主要例子。
- In this thesis, we propose a self-stabilizing algorithm for the shortest detour problem assuming the distributed demon in biconnected graph. 摘要:在本論文中,我們提出一個自我穩定演演算法以求解雙連通圖的最短繞路問題,並且假設執行模式為分散式控制系統;
- We apply the concept of self-stabilizing to solve the shortest detour problem in biconnected graph and assume the presence of distributed demon in system. 我們應用自我穩定的概念來求解雙連通圖的最短繞路問題,並且假設系統內存在一分散式控制系統。
- A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property. 最優化理論中的一個有名的問題要求:用比較容易的方法來尋求具有某種特殊性質的生成子圖。
- If T is a subgraph of a graph G, then the edges of G not included in T are called links or chords. 如果T是圖g的一個子圖,則g珠不包含在T中的邊稱為鏈支或弦。
- Then place an osg::Camera above the subgraph to create an orthographic projection. 你所要做的是將你的文字創建在一個子圖中。
- Partition,Subgraph,Degree sum,Maximum degree,Bipartite graph,Vertex-disjoint,Cycles,Paths. 剖分;子圖;度和;最大度;二部圖;頂點不交;圈;路.
- Experiments show that the approach is applicability and can find un-matched connected subgraph. 實踐證明,所提方法能夠完成工廠設計模型的數據匹配,並能判斷出不匹配的連通子圖。
- The relationship between the edge-neighbor-integrity of the graph and its subgraph was studied. 討論圖與其破邊子圖的邊鄰域完整度之間的關係;
- Frequent subgraph mining is an active research topic in the data mining community. 摘要 如何從大量的圖中挖掘出令人感興趣的子圖模式已經成為數據挖掘領域研究的熱點之一。
- GString is a subgraph search algorithm designed for chemical compound structure database. GString是針對化學化合物分子結構資料庫進行子圖搜索的演算法。
- Graph query searches the database and identifies all subgraph occurrences of a given query graph. 回答該查詢問題通常可以分為兩個階段,即查詢過濾階段與查詢驗證階段。
- It only remains to replace each edge of this diagram by a suitable subgraph which bears the information previously given by the direction and colour. 剩下要做的事只是用適當的子圖代替這個圖解的每條邊,使得原來用方向和顏色給出的信息由這個子圖來擔當。