Exploring mazes at random

DOI10.1007/S00283-025-10439-5MaRDI QIDQ7261694zbMATH OpenFDO

Authors Nikita A. Gladkov, Igor Pak

Publication date 10 June 2026

Published in The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00283-025-10439-5

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• Graph algorithms. Edited by Guy Even. With a foreword by Richard M. Karp
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Introduction to algorithms.
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• mathematical recreations

This page was built for publication: Exploring mazes at random

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