讨论了非二分图的弱距离传递性。
Weak distance-transitivity of non-bipartite graphs is also obtained.
然后，该算法被扩展来处理特殊的二分图查询。
Then, the algorithm is extended to process subgraph queries in form of bipartite graphs.
提出了一种改进的基于二分图完美匹配的布尔匹配算法。
An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented.
题意，给个二分图，要求添加最多的边形成一个完全二分图。
For each test case, output the maximum number of edges Soda can add.
刻划了具有P -正则自同态幺半群的二分图，讨论了字典序积图的自同态幺半群的P -正则性。
Bipartite graphs with P-regular endomorphism monoids are characterized. P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed.
给出二分法求解频率方程的流程图，并进行实例计算。
The numerical solution of the frequency equation by half - separation method, was studied.
完全偶图是具有二分类的简单偶图。
A complete bipartite graph is a simple bipartite graph with bipartition.
有序二分决策图(OBDD)是计算网络可靠度最有效的工具之一。
Ordered Binary Decision Diagram (OBDD) is one of the most efficient tools for computing network reliability.
然后，基于具有门限变量的布尔方程和有序二分决策图方法(OBDD)，给出计算k -终端网络可靠度算法。
And then using Boolean equations containing gate variables and means of OBDD, an efficient algorithm for computing the K-terminal reliability of a network is also proposed.
然后，基于具有门限变量的布尔方程和有序二分决策图方法(OBDD)，给出计算k -终端网络可靠度算法。
And then using Boolean equations containing gate variables and means of OBDD, an efficient algorithm for computing the K-terminal reliability of a network is also proposed.
应用推荐