Sampling Eulerian orientations of triangular lattice graphs (Q1026226): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2008.09.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039172412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3660628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path coupling without contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path coupling using stopping times and counting independent sets and colorings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Archimedean ice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice structures from planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of α-Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling of 3‐colorings in ℤ<sup>2</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Chain Algorithms for Planar Lattice Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Eulerian orientations of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Glauber dynamics by comparison of Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank

Latest revision as of 17:35, 1 July 2024

scientific article
Language Label Description Also known as
English
Sampling Eulerian orientations of triangular lattice graphs
scientific article

    Statements

    Sampling Eulerian orientations of triangular lattice graphs (English)
    0 references
    0 references
    24 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    randomised algorithms
    0 references
    Markov chain Monte Carlo
    0 references
    rapid mixing
    0 references
    torpid mixing
    0 references
    Eulerian orientations
    0 references
    0 references