A Markov chain algorithm for Eulerian orientations of planar triangular graphs
From MaRDI portal
Recommendations
- Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids
- Sampling Eulerian orientations of triangular lattice graphs
- On the number of Eulerian orientations of a graph
- scientific article; zbMATH DE number 742958
- Eulerian orientations and vertex-connectivity
- Mixing times of Markov chains on degree constrained orientations of planar graphs
- Markov chains and their application to hyperplane arrangement
- Mixing times of Markov chains on 3-orientations of planar triangulations
- Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
- scientific article; zbMATH DE number 718657
Cited in
(12)- Sampling Eulerian orientations of triangular lattice graphs
- Path coupling without contraction
- Mixing times of Markov chains of 2-orientations
- Sampling and counting 3-orientations of planar triangulations
- On sampling simple paths in planar graphs according to their lengths
- Mixing times of Markov chains on degree constrained orientations of planar graphs
- scientific article; zbMATH DE number 1966282 (Why is no real title available?)
- Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids
- scientific article; zbMATH DE number 742958 (Why is no real title available?)
- Random sampling of Euler tours
- Generating a random sink-free orientation in quadratic time
- On the mixing time of the face flip- and up/down Markov chain for some families of graphs
This page was built for publication: A Markov chain algorithm for Eulerian orientations of planar triangular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154703)
