您要查找的是不是:
- Tow Maximal Planar Graphs with Path Bichromatic Subgraph Only 两个只有路型二色子图的极大平面图
- bichromatic subgraph 二色子图
- 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. 在最后一个步骤,我们重复第一到第三步骤直到我们找不出任何密集的子网路为止。
- We investigate the free-free transition in the presence of the resonant bichromatic laser field. 摘要研究了双色共振激光场中电子原子碰撞的自由-自由跃迁过程。
- Phase control of free-free transitions in bichromatic laser field is investigated employing the Born approximation. 本文利用玻恩近似理论对双模激光场中自由-自由跃迁过程中的相位影响进行了初步研究。
- The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory. 禁向子图问题是图论中相当大的一类极值问题中的主要例子。
- The results show that the second Born approximation can succeed in bichromatic laser fields compared with the results of the First Born approximation. 结果表明,二阶玻恩近似理论在多模激光场中的应用也是比较成功的。
- A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property. 最优化理论中的一个有名的问题要求:用比较容易的方法来寻求具有某种特殊性质的生成子图。
- Based on the interaction between two ions and bichromatic radiation, the vibrational mode is only virtually excited so that the system is insensitive to the thermal field. 用双色激光同时照射两个离子,振荡模处于虚激发状态,所以系统对热场不敏感。
- 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. 讨论图与其破边子图的边邻域完整度之间的关系;