Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 97 === Let G be an n-node graph with maximum degree △. The Glauber dynamics for G, defined by Jerrum, is a Markov chain over the k-colorings of G. Many classes of G on which the Glauber dynamics mixes rapidly have been identified. Recent research efforts focus on the i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/00439599311820630491 |