go top 返回词典

您要找的是不是:

• Can I just say that we don't have a clique problem at this school?

可以说所学校里我们没有任何圈子问题吗？

youdao

• The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.

最大问题组合优化中的一个经典NP -完全问题

youdao

• The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.

最大问题一个经典图论问题，目标是找出给定的某个最大完全子图

youdao

• A new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting.

提出关于最大问题一种思路基于平均排序局部枚举算法

youdao

• The main contents are organized as follows:In chapter 1, some definitions and optimization models about the maximum clique problem are introduced.

第一章介绍了最大问题有关定义优化模型

youdao

• Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices (i. e., a clique) having the largest total weight.

给定顶点赋权无向，图的大权问题寻找每个顶点相邻的顶点子集(团)具有最大权。

youdao

• Although some business people are content that the Mexican economy is dominated by a small, powerful clique, many feel that the lack of competition is a serious problem.

虽然一些商业人士认为墨西哥经济被一小部分的富裕人群所控制，但是，多数感觉缺乏竞争一个严重的问题。

youdao

• This problem is a generalization of the problem of finding the maximum cardinality clique of an unweighted graph.

这个问题寻找无权最大问题推广

youdao

• The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.

根据从接收节点得到反馈信息，提出了一个模型来刻画基于网络编码的问题发送节点的重传策略模型化为图中的最小划分。

youdao

• The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.

根据从接收节点得到反馈信息，提出了一个模型来刻画基于网络编码的问题发送节点的重传策略模型化为图中的最小划分。

youdao

\$firstVoiceSent
- 来自原声例句