Random sampling of Euler tours
From MaRDI portal
Publication:5945917
DOI10.1007/s00453-001-0018-6zbMath0983.68149OpenAlexW2094792408MaRDI QIDQ5945917
Santosh Vempala, Prasad Tetali
Publication date: 14 October 2001
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0018-6
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Exact counting of Euler tours for generalized series-parallel graphs ⋮ Conditional exact tests for Markovianity and reversibility in multiple categorical sequences ⋮ The complexity of counting Eulerian tours in 4-regular graphs
This page was built for publication: Random sampling of Euler tours
