The purpose of this note is to give a short proof that a standard model for the Physarum polycephalum slime mold correctly computes the shortest path in an undirected weighted graph [V. Bonifaci, K. Mehlhorn, G. Varma, Physarum can compute shortest paths, in: Proc. of the 23rd ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 233-240]. © 2012 Elsevier B.V. All rights reserved.
Bonifaci, V. (2013). Physarum can compute shortest paths: A short proof. INFORMATION PROCESSING LETTERS, 113(1-2), 4-7 [10.1016/j.ipl.2012.09.005].
Physarum can compute shortest paths: A short proof
Bonifaci V.
2013-01-01
Abstract
The purpose of this note is to give a short proof that a standard model for the Physarum polycephalum slime mold correctly computes the shortest path in an undirected weighted graph [V. Bonifaci, K. Mehlhorn, G. Varma, Physarum can compute shortest paths, in: Proc. of the 23rd ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 233-240]. © 2012 Elsevier B.V. All rights reserved.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
physarum-ipl.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
DRM non definito
Dimensione
218.09 kB
Formato
Adobe PDF
|
218.09 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
