Self-stabilizing Distributed formation of Color Conflict Problem
碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 103 === Graph coloring which is a method to use as few colors as possible for painting the vertices (or edges) of a given graph and making sure there is no two adjacent vertices share the same color. Graph coloring can be viewed as a simplification of resource allocat...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/27832245777990911811 |