图着色问题是著名的NP-完全问题。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
图着色问题(GCP)是NP完全问题。
本文给出了图顶点着色问题的DNA粘贴算法。
In the dissertation, DNA sticker algorithm of vertex-coloring problems is given out.
已发现一类着色问题的求解，显现出重尾分布的现象。
We observe the heavy-tailed distribution of cycles in solving some graph coloring instances.
基于图着色问题的特点，设计了一种新的、有效的杂交算子。
An effective crossover is designed according to the characteristic of the GCP.
着色问题实质上就是划分问题，一种色对应于划分的一个部分。
Coloring problem is indeed a kind of partition problem, and each color class corresponds to one part of the partition.
提出并证明了边着色问题的基本定理，设计并实现了闭环dna计算算法。
The basal theorem of DNA algorithm for edge-coloring is given and proved, and DNA algorithm on closed circle DNA was designed and realized.
其次，文章研究了平面图的列表着色问题，给出了平面图3 -可选的一个充分条件。
Secondly, we investigate the list coloring of planar graphs, and give a su? Cientcondition for a planar graph being 3-choosable.
图的着色问题一直是图论中的重要问题，并且在离散数学和组合分析中有着重要的应用。
The coloring problem is always important problem in graph theory. In the discrete mathematics and combinatorial analysis, the coloring problem has a wide range of applications.
该文通过一个图形着色问题作为教学主题，提出一种比较容易实现的高职数学建模的教学设计理念。
Taking an issue in graph coloring as a teaching subject, the paper puts forward a feasible concept in the design of HVE mathematical modeling teaching.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
本文在前人研究的面着色问题基础上，运用欧拉公式和握手定理通过解方程组得到连通平面图的面色数。
In this paper, Euler's formula and Handshaking lemma is used to obtain the face chromatic number of a planar graph by solving equations.
给出了文件传输问题的边着色模型。
到目前为止，对于一般的图，全着色猜想仍然是一个公开的问题。
So far, for any graph, the Total Coloring Conjecture is still an open problem.
着色聚酯纤维在进一步处理加工中的低聚物问题与纤维本身一样古老，至今仍未解决。
The still not solved oligomer problem during further processing of dyed PET fibers is as old as the fiber itself.
聚丙烯纤维原浆着色和改性聚丙烯纤维染色能在一定程度上增加纤维的可染性，然而不能从根本上解决服用聚丙烯纤维染色困难问题。
The dyeability of PP fibers can be enhanced to some extent by dope dyeing and modification of PP fibers, but the problems in dyeing have not been solved radically.
给出了停机位分配问题顶点着色模型及其分解算法。
Vertex coloring model and decomposing algorithm of gate assignment problem is offered.
同时给出了文件传输问题的边着色模型。
A edge coloring model for File Transmission Problems is given.
叙述了铝氧化着色和封孔的基本原理，阐明了影响质量的一些关键问题。
Basic principles of aluminium oxidation, coloration and sealing are described. A few key problems affecting the quality are elucidated.
图式流形的同胚分类可转化为图的一类2 -边着色计数问题。
The homeomorphism classification of graph like manifolds can be transformed into a 2 edge colouring enumeration problem for graphs.
图的邻强边着色算法是一个NP完全问题。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
论述了国内外LLDPE地膜着色专用碳黑母粒制造中的技术问题。
The key technical questions in producing carbon black masterbatch for coloring of LLDPE mulching film in China and abroad were reviewed.
解决这个问题的第一个办法是是改变深度。这个深度由像素着色器根据储存在粒子纹理中的深度生成。
The first approach to dealing with this is to perturb the depth being output from the pixel shader by a depth stored in the particle texture.
作为UI着色器通常的标准化，最常见的问题是过度的填充率使用。
As the UI shader is generally standardized, the most common problem is simply excessive fill-rate usage.
介绍了粗旦丙纶强力丝的生产工艺、着色方法及存在的问题。
The production technology, the method of stain and the problems in the production are introduced.
介绍了粗旦丙纶强力丝的生产工艺、着色方法及存在的问题。
The production technology, the method of stain and the problems in the production are introduced.
应用推荐