As well as do not participate in the clique moving.
以及不要参与派系活动。
Vickie looked like she was ready to fight the clique.
薇奇看起来已经做好了迎战的准备了。
The team culture and the clique culture all subordinate in the enterprise culture, they all have the vital significance to the business management of our country.
团队文化和小团体文化都隶属于企业文化，团队文化与小团体文化对我国企业管理具有重要意义。
He was accepted into the most popular clique on campus.
他被吸收到了校园里最受欢迎的小团体里。
But if he wins power, his record is so contradictory it is not clear if he would rule to serve the narrow interests of his clique, or the pressing needs of the country.
但是如果他获得权力，从他那矛盾的记录里，人们无法弄清他当政将会是为狭隘的派系利益服务，还是服务于国家的迫切需求。
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.
虽然，一些商业人士认为墨西哥的经济被一小部分的富裕人群所控制，但是，多数感觉缺乏竞争是一个严重的问题。
Adrian’s indifference to playing it cool somehow made him the leader of the boys’ clique when they were teenagers; he became the one they looked up to.
安德瑞从青少年时起就不喜欢装酷、耍帅，这使他成了朋友圈中人缘最好的领头人，朋友都把他当作榜样。
It's natural to feel out of place in the beginning, but resist the temptation to engage in office gossip or to get pulled into a clique right away.
开始的时候感到自己有些“格格不入”是很自然的现象，但是你要管住自己不要立刻参与办公室的闲聊或被拉入“帮派”当中。
It is based on the markov random field with new features, such as clique potential, initial nodes probability density.
此应用是基于马尔可夫随机场的新特性：势团势能，初始节点的概率密度。
This problem is a generalization of the problem of finding the maximum cardinality clique of an unweighted graph.
这个问题是寻找无权图的最大团问题的推广。
This paper examines the process of clique formation among company employees using the agent-based simulation model.
本文以行动者的模拟模型考察公司中的雇员形成派系的过程。
After unifying Guangxi in the year of 1925, the New Gui Clique began the transport construction.
1925年，新桂系统一广西后，便开始着手广西的交通建设。
The open and close of septa velum Clique is by the pipeline pressure on the septa velum Clique .
隔膜阀的关闭与开启是通过来自管路的压力作用于增强橡胶隔膜实现的。
A new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting.
提出了关于最大团问题的一种新思路基于平均度排序的局部枚举算法。
Each of these actions might again be communicated instantly to the news feeds of their clique.
而且每一个活动都可以马上传到他们小圈子的新闻地带。
The consistency of the allocation result and the convergence speed of clique partition algorithm can be improved greatly by the heuristic method.
不仅提高了团划分算法求解功能单元分配问题的计算结果一致性，而且使算法的收敛速度得以提高。
How to find the maximum edge-weighted clique?
如何找到边缘最大加权集团？
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大团问题是组合优化中的一个经典的NP -完全问题。
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.
给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。
The empirical study indicates the extensively existence of power-law clique-degree distribution, which is an independent character to scale-free property.
实证研究显示，大量不同领域中抽象出来的网络都具有近似服从幂律的低阶集团度分布。
Weeks of sliding equity prices have wiped out billions of dollars of wealth for the region's influential clique of local retail investors.
近几周来股价的下跌已经让该地区深具影响的当地个人投资者损失了数十亿美元。
The main contents are organized as follows:In chapter 1, some definitions and optimization models about the maximum clique problem are introduced.
在第一章，介绍了最大团问题的有关定义和优化模型。
The largest clique meets the criterion that its node sets are not of approximate subsets of any other clique.
最大基团满足其节点集合不是任何其他基团节点集的适当子集。
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.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
We propose the notion of strong junction property. The existence of clique tree which has the strong junction property are discussed.
接着我们提出了关于团树强连接性的概念，并且证明了具有强连接性质的团树的存在性。
The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
应用推荐