论文信息 - Random Sampling of Euler Tours

Random Sampling of Euler Tours

We define a Markov chain on the set of Euler tours of a given Eulerian graph based on transformations first defined by Kotzig in 1966. We prove that the chain is rapidly mixing if the maximum degree in the given graph is 6, thus obtaining an efficient algorithm for sampling and counting the set of Euler tours for such an Eulerian graph.

Santosh S. Vempala | Prasad Tetali

[1] Robert E. Woodrow,et al. Cycles and rays , 1990 .

[2] A. Bouchet,et al. κ -Transformations, Local Complementations and Switching , 1990 .

[3] Brendan D. McKay,et al. The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs , 1990, Comb..

[4] L. Lovász. Combinatorial problems and exercises , 1979 .

[5] Anton Kotzig,et al. Transformations of Euler Tours , 1980 .

[6] Brendan D. McKay,et al. Asymptotic Enumeration of Eulerian Circuits in the Complete Graph , 1998, Combinatorics, Probability and Computing.