1) Graph vertex coloring
图的顶点着色
1.
Graph vertex coloring problem (GVCP) is a NP-complete problem having good application such as scheduling and timetabling.
本文对图与组合优化问题中的一个典型问题,即图的顶点着色问题进行了研究。
2) vertex-coloring of graph
图顶点着色
3) graph vertex coloring problem
图顶点着色问题
4) vertex coloring
顶点着色
1.
Mind evolutionary computation is used in solving vertex coloring problem.
应用思维进化计算求解顶点着色问题,给出求解给定图的色数、最小着色的算法。
2.
Based on the principle of graph theory, the paper transforms the matching/storing problem of railway dangerous goods into vertex coloring problem.
应用图论的原理将危险货物的配放问题转化为对图的顶点着色问题。
5) vertex shader
顶点着色
1.
Based on current computer graphics hardware a technique is proposed for calculating irradiance environmental maps using vertex shader.
为了实现动态光照环境下辐照度环境纹理图的实时绘制,基于当前的通用图形硬件,提出了一种采用顶点着色器快速计算辐照度环境纹理图的方法。
2.
Facial behavior for ANPC is implemented by blending morph vertex shader(BMVS) technique in which the meshes of previously created animations,such as blinking,smile and visemes,can be blended to form new and unique animations on the fly and in real time.
用一种混合变形顶点着色(BMVS)技术实现ANPC的面部行为,该技术可以把各个行为动画,如眨眼、微笑、视位(visemes),混合形成整个面部行为动画。
6) vertex-coloring
顶点着色
1.
Then it is substituted in Burnside formula,all vertex-coloring formulas of the regular polyhedron are determined.
然后代入伯恩塞德公式,求得所有正多面体的顶点着色公式。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条