An algorithm for finding shortest paths in a maze

DOI10.1080/02331938608843123zbMath0593.90081OpenAlexW2088250058MaRDI QIDQ3724109

Boris V. Cherkassky

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938608843123

zbMATH Keywords

shortest pathsequivalent networkrunning-time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Paths and cycles (05C38)

Cites Work

• Unnamed Item