Sampling and Counting 3-Orientations of Planar Triangulations
From MaRDI portal
Publication:2804991
DOI10.1137/140965752zbMath1337.60174OpenAlexW2342714555MaRDI QIDQ2804991
Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali
Publication date: 9 May 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/126e32f88d7b5a2118ec37e33aceff3df54e6940
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Slow mixing of Markov chains using fault lines and fat contours
- On the number of planar orientations with prescribed degrees
- Sampling Eulerian orientations of triangular lattice graphs
- Random generation of combinatorial structures from a uniform distribution
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Planar graphs and poset dimension
- Comparison theorems for reversible Markov chains
- Mixing times of lozenge tiling and card shuffling Markov chains
- Watermelon uniform random generation with applications
- On the number of Eulerian orientations of a graph
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Analyzing Glauber dynamics by comparison of Markov chains
- Markov Chain Algorithms for Planar Lattice Structures
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- A more rapidly mixing Markov chain for graph colorings
- Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations
- On topological aspects of orientations
- Convex drawings of planar graphs and the order dimension of 3-polytopes
This page was built for publication: Sampling and Counting 3-Orientations of Planar Triangulations
