期刊
INFORMATION PROCESSING LETTERS
卷 113, 期 1-2, 页码 4-7出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2012.09.005
关键词
Combinatorial problems; Natural algorithm; Shortest path; Thomson's principle
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]. (c) 2012 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据