Novel genetic algorithm for the graph coloring problem;
图着色问题的新遗传算法
Bi-objective evolutionary algorithm for the graph coloring problem;
双目标进化算法求解图着色问题
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
This paper adopts a kind of chaotic neural network algorithm based on annealing strategy(ACNN) for solving four-coloring map problem.
采用一种基于退火策略的混沌神经网络(ACNN)算法求解四色图着色问题。
For the objective to decrease the DNA volume of the 3-colorable problem,an improved DNA computing model basing on the biological operations in the Adleman-Lipton model and the solution space of stickers in the sticker-based model is introduced.
为减少图3-着色问题DNA计算机算法中的DNA链数,本文将Adleman-Lipton模型生物操作与粘贴模型解空间相结合的DNA计算模型进行扩展,通过设计顶点着色器、稀疏图/稠密图搜索器,提出一种用于求解图3-着色问题的DNA计算模型与算法。
Research on Computational Model of DNA Self-Assembly and Its Application in Graph Coloring Problem
DNA自组装计算模型研究及其在图着色问题中的应用
Research on Equitable Total Coloring and Rainbow Domination of Some Graphs;
若干图的等全着色及彩虹支配问题的研究
Teaching Design Of HVE Mathematical Modeling In Graph Coloring;
从图形着色问题谈高职数学建模的教学设计
An Approximate Algorithm for the(k,d)-Coloring Problem
图的(k,d)-着色问题的一个近似算法(英文)
A Graph Coloring Algorithm for Optimization of Course Examination Arrange Problem
图着色算法解决考试时间安排问题的优化
On the Total Coloring、Entire Coloring and Choosability Coloring of Some Graphs;
若干图类的全染色、完备染色和选色问题研究
took the initiative in trying to solve the proBlem.
开始着手试图解决这个问题
Study about Hamiltonian, Ramsey Number and Four Colored Problem of Graphs;
图的Hamilton性、Ramsey数和四色问题的研究
On the Sum (multi-) Coloring Problem on (Proper) Interval Graphs;
（真）区间图的（多重）染色和问题
The 4-choosability of Some Plane Graphs without Adjacent Triangles;
不含相邻三角形平面图的4-选色问题
A Probe into the Construction of Distinctive Database in Libraries
图书馆特色数据库建设若干问题研究
The Adjacent Vertex-distinguish Total Coloring and the Coloring Problem That be Submitted to the Total Colors Subgraph;
图的邻点可区别全染色和有全色子图限制的染色问题
The Chinese Mouse Problem and 4-coluring of G(p,q,f)
中国老鼠问题与G(p,q,f)的4着色
Minimum Cost Reachability Problem of Price Coloured Petri Net
价格着色Petri网的最小成本可达问题
Relations among the Parameters of Hypergraphs and Colourings of Hypergraphs;
超图各参数间的关系以及超图的边色数问题
Lablelling Graphs with a Condition on Neighborhood of Graphs and L (2,1) -labelling of Graphs
有邻域限制的图染色问题及图的L（2，1）—标号
On the Adjacent Strong Edge Coloring and 2-strong Edge Coloring of Some Graphs;
若干图类的邻强边染色与2-强边染色问题研究
Big images mean big loading problem.
大尺寸的图片意味着大问题的加载速度。
