vertex coloring 中文意思是什麼
-
The total colors maximal cliques vertex - coloring of some graphs
幾類圖的全色極大團染色 -
A color a e x is legal for an uncolored vertex v e v if by coloring v with a, the subgraph induced by all vertices of color a has maximum degree at most d
對頂點v是合法的，是指由所有染顏色。的頂點導出的子圖的最大度至多是d ，其中alice和bob每走一步都是用合法顏色染未染色點。 -
To better elucidate the following critical problems - - building the rational mathematics model and searching the effective algorithms, this paper sets forth the basis of algorithms and heuristic algorithm. meanwhile it compendiously introduces the main principles of genetic algorithm and the stimulated annealing algorithm, principal parameters during the course of solving problems and vertex coloring theory
為了更好地說明下文所要解決的關鍵問題? ?建立合理的數學模型和尋找有效可行的演算法，本文闡述了演算法和啟發式演算法的理論基礎，並扼要地介紹了遺傳演算法、模擬退火演算法的主要思想和在解題過程中應用的重要參數，以及圖的著色理論；及其在作業計劃編制中應用的可能性。 -
Method on vertex strong total coloring of halin graphs
圖的一個點強全染色法 -
The adjacent vertex - distinguishing total coloring of special graphs
幾類特殊圖的鄰點可區別全染色 -
On adjacent vertex - distinguishing total coloring of three special graphs
三類特殊圖的鄰點可區別全染色 -
Some new results on the adjacent vertex - distinguishing total coloring of graphs
關于鄰點可區別全染色的幾個新結果 -
The algorithm applies a simple clique finding and weighted coloring to determine lower and upper bounds, and actives exactly one new search tree node at each branching stage which using the information obtained in the weighted coloring to choose a branching vertex, and uses backtracking method to obtain optimum solution
該演算法用團的簡單啟發式演算法提供下界；用加權著色的啟發式演算法提供上界；在分支階段，每次只產生一個新的子問題，並利用著色信息來選擇分支頂點；最後利用回溯法來檢驗整體最優性。 -
The adjacent vertex - distinguishing total coloring of some classes of graphs
幾類圖的相鄰頂點可區別的全染色
分享友人