An enumeration problem is solved for labeled consistent bipartite tournaments, and a sharp formula is obtained.
通过讨论，解决了标定一致二部竞赛图的计数问题，并获得了一个简明计算公式。
The homeomorphism classification of graph like manifolds can be transformed into a 2 edge colouring enumeration problem for graphs.
图式流形的同胚分类可转化为图的一类2 -边着色计数问题。
In this paper, we mainly discuss the enumeration problem of the equivalence class of 3-nilpotent matrix defined in normal number fields.
主要对定义在一般数域上的3 -幂零矩阵的相似等价类的个数问题进行探讨。
In the last chapter, we consider the enumeration problem of RNA secondary structures only for the fixed pairs using the pairing function.
在最后一章，我们通过配对函数考虑了特定配对情况下的RNA的二级结构计数问题。
The enumeration problem for connective graphs with one nontrivial block was discussed by the theory of combinatorics, and the new conclusion is also given.
利用组合理论和图的计数理论，讨论了只含有一个非平凡块的连通图的计数问题，给出了新的结论。
The problem of induction by simple enumeration remains unsolved to this day.
单纯枚举归纳问题到今天依旧是悬案。
A mathematical programming method is developed, by considerina the optimal placement of active control forces as a generalized0-1programming problem and solving it by implicit enumeration.
用数学规划方法研究主动控制力（简称控制力）在被控结构上的最优位置，把它视为广义0-1规划问题，用隐枚举法求解；
In this paper, the problem of multi-centres in a network is solved using implicit enumeration method for 0-1 integer programming. The algorithm is simple and can be easily realized.
本文提出用0 - 1整数规划的隐枚举法，求解网络的多中心问题，算法简单，容易实现。
This article gives three algorithms for all permutations of 1 to N, analyzing the application of this problem in stack and enumeration of binary tree.
文章给出了1至N全排列问题的三种求解算法，分析了该问题在栈及二叉树计数中的应用。
Theoretically speaking, the enumeration not only can solve TSP problem but also can get the best answer.
从理论上讲，使用穷举法不但可以求解tsp问题，而且还可以求出该问题的最优解。
Theoretically speaking, the enumeration not only can solve TSP problem but also can get the best answer.
从理论上讲，使用穷举法不但可以求解tsp问题，而且还可以求出该问题的最优解。
应用推荐