Random sampling of Euler tours

DOI10.1007/S00453-001-0018-6MaRDI QIDQ5945917zbMATH OpenOpenAlexFDO

Authors Prasad Tetali, Santosh S. Vempala

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

zbMATH Keywords

Markov chainEulerian graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• The number of Euler tours of random directed graphs
• scientific article; zbMATH DE number 2127753
• The number of Euler tours of a random directed graph
• Exact counting of Euler tours for generalized series-parallel graphs
• scientific article; zbMATH DE number 742958

Cited in

(6)

• scientific article; zbMATH DE number 1966282 (Why is no real title available?)
• Exact counting of Euler tours for generalized series-parallel graphs
• Sampling arborescences in parallel
• Conditional exact tests for Markovianity and reversibility in multiple categorical sequences
• scientific article; zbMATH DE number 742958 (Why is no real title available?)
• Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids

This page was built for publication: Random sampling of Euler tours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945917)