Random Sampling of Euler Tours
- Cite this article as:
- Tetali, P. & Vempala, S. Algorithmica (2001) 30: 376. doi:10.1007/s00453-001-0018-6
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.