| Summary: | 碩士 === 國立中正大學 === 資訊工程研究所 === 89 === A vertex-coloring of a graph G=(V,E) is to color its all vertices with positive integer such that no adjacent vertices get the same color. The problem of minimum vertex chromatic sum of a graph is to color vertices such that the sum of all assigned colors is minimum. This problem is NP-hard on general graphs. In this paper, we present an O(Δn^(3.5)log n)-time algorithm by using a dynamic programming technique to solve minimum vertex chromatic sum problem on the block graph G, where Δ is maximum degree of the block graph G, and n is the number of all vertices in graph G.
|
|---|
