%0 Conference Paper %1 conf/icalp/BecchettiBDKM13 %A Becchetti, Luca %A Bonifaci, Vincenzo %A Dirnberger, Michael %A Karrenbauer, Andreas %A Mehlhorn, Kurt %B ICALP (2) %D 2013 %E Fomin, Fedor V. %E Freivalds, Rusins %E Kwiatkowska, Marta Z. %E Peleg, David %I Springer %K %P 472-483 %T Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. %U http://dblp.uni-trier.de/db/conf/icalp/icalp2013-2.html#BecchettiBDKM13 %V 7966 %@ 978-3-642-39211-5

@inproceedings{conf/icalp/BecchettiBDKM13, added-at = {2023-12-14T16:47:31.000+0100}, author = {Becchetti, Luca and Bonifaci, Vincenzo and Dirnberger, Michael and Karrenbauer, Andreas and Mehlhorn, Kurt}, biburl = {https://www.bibsonomy.org/bibtex/296463dbe81e15a4d52ec8a50023af8d4/admin}, booktitle = {ICALP (2)}, crossref = {conf/icalp/2013-2}, editor = {Fomin, Fedor V. and Freivalds, Rusins and Kwiatkowska, Marta Z. and Peleg, David}, ee = {https://www.wikidata.org/entity/Q60587872}, interhash = {fd2ab23206afca404f05e3386bad1e22}, intrahash = {96463dbe81e15a4d52ec8a50023af8d4}, isbn = {978-3-642-39211-5}, keywords = {}, pages = {472-483}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-14T16:47:31.000+0100}, title = {Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds.}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2013-2.html#BecchettiBDKM13}, volume = 7966, year = 2013 }