Compared to traditional bigraph matching algorithm, the improved one has higher efficiency. 与传统的偶图匹配方法相比,改进算法具有更高的匹配效率。
The time complexity of the algorithm is O (| V+|+| V-|) 3, where| V+|,| V-| is the number of vertex and edge of bigraph. 该算法的复杂度为O(V~++V~-)~3,其中V~+和V~-分别代表偶图中顶点和边的个数。
DM-decomposition algorithm obtains a series of subgraphs by decomposing the representative bigraph of the automated geometric deduction, and these subgraphs represent a series of small rigids correspondingly. DM-分解算法是通过对几何自动推理问题的表示偶图的分解来得到一系列的子图,这些子图分别对应着一系列的小刚体。
After, we have analyzed the problems of these methods, and pointed out the direction for our work. Secondly, drawing on the idea of graph theory, we propose a new method for large-scale ontology partition and mapping based on bigraph model. 然后,从图论的思想出发,提出了一种基于二部图模型的大规模本体分块与映射方法。
The arithmetic, which based on the DM decomposition of bigraph, could distinguish the problem is under, over or complete constraint and find the position, where under or over constraint happens. 基于偶图的DM分解的判定算法,可以判定几何约束问题的欠、过、完整约束性,并可以确定欠、过约束发生的位置。
After the further research on the travel behaviors, a formal model is proposed to describe the passenger travel behaviors in the rail transit network based on the bigraph theory. 深入研究交通出行行为,利用偶图理论对出行者在轨道交通网络中的出行行为进行形式建模。
The improved algorithm of maximum-weight perfect matching is adopted to finish respective matching, and then the results of independent matching of many bigraph systems are spliced to gain the most possible sequences of BF produced by multi-business, which is convenient for subsequent analyzing. 在这些偶图系统中,采用最大权重完全匹配的改进算法进行分散匹配,然后通过拼接匹配结果得到各事务产生踪迹的最可能序列,便于后续分析处理。
If the transition time among these events are independent and identically distributed, all possible states ( events) are separated into multi-cutsets, each of them forms a bigraph system. 对于事件间的转换时间是独立等同分布的情况,本文将所有可能状态(事件)划分为若干个割集,每个割集形成一个偶图。