查询
1 词典释义:
bipartite graph
时间: 2025-06-17 23:24:38
英 [bʌɪˈpɑːtʌɪt ɡrɑːf]
美 [baɪˈpɑrˌtaɪt ɡræf]

偶图;二分图;双分图

双语例句
  • Bipartite Graph is important data structure for data base system etc.

    二部图是数据库等应用系统的重要的数据结构。

  • A complete bipartite graph is a simple bipartite graph with bipartition.

    完全偶图是具有二分类的简单偶图。

  • The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.

    得到了扇和完全等二部图联图的边色数。

  • The architecture is represented by a bipartite graph and its relation with a general graph is also discussed.

    文中用两类节点的二分图表示所提出的网络结构,并讨论了其与一般图表示方法问的关系。

  • This scheduling algorithm takes the bipartite graph matching and the backtracking techniques as mathematical tools.

    该算法以偶图匹配、回溯技术为数学工具。

  • The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.

    MSS 问题的目标,是在一个二分无向图上寻找由互不相交的路径所构成的集合,并要求这个集合满足一些特定的条件。

  • In Chapter 4, we consider the 2-catalog Segmentation problem which is equivalent to some kind of bipartite graph partition problem.

    在第四章,我们研究二目录分割问题,它等价于一个基于二部图上的某种划分问题。

  • By inserting a new set of medium vertices in a complete bipartite graph, we extend Pigeon-hole formula to general pigeon-hole formula.

    鸽巢公式的一个真值指派可以用一个边带标记的完全二分图表示。

  • G is said to be bipartite matching extendable (BM-extendable) if every matching m whose induced subgraph is a bipartite graph extends to a perfect matching of g.

    称g是偶匹配可扩的,如果G中导出子图是偶图的匹配m都可以扩充为g的完美匹配。

  • On the base of a variety of calculation of matrix used on the empowering bipartite graph, the solutions are further given to solve the linear equations in the graphs.

    本文在赋权二部图上施行矩阵的各种运算之基础上,进一步给出用图求解线性方程组的方法。

  • Based on the fault information matrix obtained from the bipartite graph model and the Boolean algebra system, a MINLP model orienting sensors optimization is proposed.

    依据传感器选择优化的特点,引入无限布尔代数理论,基于此,提出一个传感器优化问题的MINLP模型。

  • An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented.

    提出了一种改进的基于二分图完美匹配的布尔匹配算法。

  • This article gives a solution to the programming 0-1 problem whose objective function is a nonlinear function, by applying weighted bipartite graph and perfect matching.

    本文对一种目标函数为非线性函数的0—1规划问题提出了一种运用赋权偶图及完美对集的求解方法。

  • By the graph representation, we discuss the girth and diameter of a bipartite graph, and their roles in improving the efficiency of decoding algorithms and the performance of the code.

    根据低密度码的图结构表示,研究双向图的周长、直径,及其对提高译码算法效率和码的性能所起的作用。

  • However, the performance of LDPC code depends on the girth of its bipartite graph, that is it depends on its sparse parity-check matrices H, especially the complexity of encoding with H.

    而LDPC码性能的优劣,与其二分图中是否存在短长度的圈有关,也即与其奇偶校验矩阵的构造有关。

  • This graph is NOT bipartite, since there are many triangles in it.

    这个图不是二部图,因为里面存在许多三角形。

  • A new algorithm of curriculum schedule based on bipartite-graph matching and Tabu search is proposed to meet the new requirements of the universities.

    针对目前高校的特点,提出一种偶图匹配和禁忌搜索相结合的排课新算法。