您要查找的是不是：
- 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. 剩下要做的事只是用适当的子图代替这个图解的每条边，使得原来用方向和颜色给出的信息由这个子图来担当。
