查询词典 transitive graph

Basing on this, this paper proposes a generalized shortest path method. That is, by constructing an intermodal-network multi-ply graph which interrelates the data and information in transit with the nodes and sides of the graph, adding virtual origin and destination stations to the graph, and then analyzing transport costs and transfer costs, this paper applies the Dijkstra algorithm to solve the intermodal optimal transport path problem so as to get the intermodal transport plan with the least generalized costs.

在此基础上，提出一种求解最佳运输路线的广义最短路法，即通过构建多式联运网络多重图，将运输过程中的数据、信息和图中的节点、边关联起来，然后对运输费用和中转费用进行分析估计，并通过在联运网络图中加入虚拟的发、到站，使得该问题可用Dijkstra算法进行求解，从而获得广义费用最少的联运方案。

The symmetry of graphs has been being a very hot issue in studing the group and graph and it is mainly described by some transitive properties of acting by their automorphism groups.

在群与图研究中，图的对称性一直是一个热门问题。它主要通过图的自同构群具有某些传递性来描述。

The following results are obtained: Let G be a connected point-transitive graph.

得到以下结果：设G是一个连通的顶点可传递图。

B Let G be a connected point-transitive graph.

b设G是一个连通的顶点可传递图。

The construction of schemes for directed transitive graph is left as an open problem.

怎样构造针对有向图的签名却作为公开问题遗留了下来。

A novel description of test schedule based on transitive closure graph is proposed in this paper, and it is suitable for combinational optimization.

本文提出了基于传递闭合图的测试调度表示法，该表示法符合P-admissible准则，使组合优化算法适用于SoC测试调度问题。

And several methods such as graph,matrix,compound of two binary-relations,transitive closure,etc.are used to identify the transitivity of binary-relation.

通过给出二元关系传递性的两个等价定义以及几种方法来帮助深入理解和掌握二元关系

A novel scheme using the Transitive Closure Graph representation is proposed to explore the symmetry solution space in the placement problem, which usually abounds in complex constraints.

提出一种新颖的使用传递闭包图的表示方法，通过TCG表达的广义对称可行性和狭义对称可行性条件，将其引申到探索解决具有高复杂限制条件，并且期望产生对称解空间的排样问题。

Let G be a k-regular connected vertex transitive graph.

设图G是一个κ-正则连通点可迁图。

There are two parts in this paper:In the first part, the s -arc transitive problem of odd graph K_(2r+1,r) is investigated.

Godsil等证明了每一个奇图K_(2r+1，r)至少是2-弧传递图，那么自然提出问题： K_(2r+1 ，r)是s-弧传递的s的最大值是多少？

These rules reflect some inherent feature of self and nonself, and they are the basic detection criterion of GECISM.

这些规则反映了"自我"和"非我"的内在特征，是GECISM进行"非我"检测的判据。

Until today, the media from China and the outside world still uses the term "Post 89". Regardless to whether it is for commercial gimmick or convenience, everybody still remember "Post 89", a term which carries a strong Cantonese accent.

时至今日，国内外艺术媒体还是在沿用&后八九&这个称谓，不管当初是为了商业噱头还是容易上口好记，反正大家现在是记住了&后八九&这个广东口音很重的词。