Physarum can compute shortest paths: a short proof
From MaRDI portal
Publication:1941685
DOI10.1016/j.ipl.2012.09.005zbMath1259.68054OpenAlexW2059723729MaRDI QIDQ1941685
Publication date: 21 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11590/381607
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Two results on slime mold computations ⋮ A parallel bio-inspired shortest path algorithm ⋮ On the convergence time of a natural dynamics for linear programming ⋮ A revised model of fluid transport optimization in \textit{Physarum polycephalum} ⋮ On the Convergence Time of a Natural Dynamics for Linear Programming ⋮ Convergence of the non-uniform directed physarum model ⋮ Convergence of the non-uniform physarum dynamics
This page was built for publication: Physarum can compute shortest paths: a short proof
