Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity

DOI10.1007/978-3-319-08016-1_26zbMath1407.68582OpenAlexW308225153MaRDI QIDQ3188856

Shuigeng Zhou, Jihong Guan, Yi Yang

Publication date: 2 September 2014

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08016-1_26

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial games (91A46)

Related Items (1)

Exact percolation probabilities for a square lattice: site percolation on a plane, cylinder, and torus

This page was built for publication: Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity