Self-Stabilizing Acyclic Colorings of Graphs
碩士 === 國立清華大學 === 資訊工程學系 === 92 === This thesis proposes two self-stabilizing algorithms for acyclic colorings of graphs. An acyclic coloring of a graph G is a coloring of the vertices of G such that the vertices with the same color in G induces an acyclic subgraph. The first algorithm we proposed n...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/47699278763839872663 |