Memoryless routing in convex subdivisions: random walks are optimal
From MaRDI portal
(Redirected from Memoryless routing in convex subdivisions: random walks are optimal)
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.