graph coloring的例句大全

The graph coloring problem ( GCP) is a widely studied combinatorial optimization problem.

图的着色问题是一个被广泛研究的组合优化问题。

research on computational model of dna self-assembly and its application in graph coloring problem

DNA自组装计算模型研究及其在图着色问题中的应用

The graph coloring problem is a well-known NP-complete problem.

图着色问题是著名的NP - 完全问题.

Greedy algorithm is a simple approximative method in graph coloring.

贪心算法用于图的染色问题是一种简单的近似方法。

A Graph Coloring Algorithm for Optimization of Course Examination Arrange Problem

图着色算法解决考试时间安排问题的优化

Graph Coloring problem ( GCP) is an NP hard problem.

图着色问题（GCP）是NP完全问题。

Ochoa conducted a fitness landscapes analysis on a hyper-heuristic search space by using graph coloring heuristics for timetabling.

Ochoa在用图染色算法求解课程表问题时，对超启发式算法空间进行了适应度地貌分析。

jensen and b. toft asserted: the graph coloring theory in discrete mathematics at the center position.

因此Jensen和Toft断言：图着色理论在离散数学中处于中心的地位。

So, we present group genetic algorithms ( GGA) to solve the graph coloring problem.

因此提出利用分组遗传算法的不定长分组编码方式来彻底解决编码冗余问题。

In summary, this thesis makes the following contributions: ( 1) Proposes permutation graph coloring algorithm for scratchpad memory allocation.

本文的主要工作和创新概述如下：（1）提出了基于置换图着色的便笺存储器分配算法。

on the adjacent strong edge coloring of joining graph with star and complete balanced bipartite graph

星和完全等二部图联图的邻强边染色

the edge coloring of double-outer planar graph

双外平面图的边染色

Ramsey theory constitutes the main research area of graph theory, and 3-coloring Ramsey theory is an important branch of Ramsey theory, the determination of 3-coloring Ramsey number is also an important research direction of Ramsey theory, and it is meanwhile a No-Polynomial Problem.

Ramsey理论是图论的重要研究内容之一，而3色Ramsey数理论是其中一个重要的理论分支，对于3色Ramsey数的确定也是一个重要的研究方向，属于NP困难问题。

An incidence coloring of graph G is a mapping from the incidence set I ( G) to color set C such that any two neighborly incidences are assigned different colors.

图G的关联着色是从关联集I（G）到颜色集C的一个映射使得任意两个相邻的关联不着同色。

The minimum number of colors required for an adjacent vertex-distinguishing total coloring of a simple graph G is called the adjacent vertex-distinguishing total chromatic number, denoted by xat ( G).

若一个正常全染色其相邻顶点的色集不同时，就称之为邻点可区别全染色，邻点可区别全染色所用颜色的最小数称为邻点可区别全色数。

for a graph g, f is a strong edge coloring if it is proper and any two vertices are incident with different sets of colors.

如果图G有一个合理边上色，使图G的所有相邻顶点的关联边上色集合都互不相同，则称图G为准强边着色。

Cycle time assignment of nonlinear discrete event dynamic systems and coloring condensation graph

非线性DEDS的周期时间配置与凝着色图

The coloring method to negate Hamilton properties of a graph

图的Hamilton问题的着色否定方法

Adjacent vertex distinguishing total coloring on 2-connected outer plane graph

2-连通外平面图的邻点可区别全染色

the coloring and edge number of minimal n-edge connected graph

极小n棱连通图的着色与棱数