Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn. Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Volume 7966 of Lecture Notes in Computer Science, pages 472-483, Springer, 2013. [doi]
@inproceedings{BecchettiBDKM13, title = {Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds}, author = {Luca Becchetti and Vincenzo Bonifaci and Michael Dirnberger and Andreas Karrenbauer and Kurt Mehlhorn}, year = {2013}, doi = {10.1007/978-3-642-39212-2_42}, url = {http://dx.doi.org/10.1007/978-3-642-39212-2_42}, researchr = {https://researchr.org/publication/BecchettiBDKM13}, cites = {0}, citedby = {0}, pages = {472-483}, booktitle = {Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II}, editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg}, volume = {7966}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-39211-5}, }