Heuristic methods to determine the rainbow connectivity of a graph
碩士 === 國立高雄應用科技大學 === 資訊工程系 === 103 === Let G be an edge-colored graph. If G has non-repetitive colors on at least one path between any two distinct nodes, G is called rainbow connected. We used Genetic Algorithm to find the smallest possible rainbow connection colors. Using graph characteristics, w...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42229136466344243077 |