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, pp. 233-240, SIAM 2012].
Physarum can compute shortest paths: A short proof
Bonifaci V
2013
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, pp. 233-240, SIAM 2012].File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
