×

Found 5 Documents (Results 1–5)

Physarum can compute shortest paths: convergence proofs and complexity bounds. (English) Zbl 1335.68099

Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-39211-5/pbk). Lecture Notes in Computer Science 7966, 472-483 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Physarum can compute shortest paths. (English) Zbl 1420.68088

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 233-240 (2012).
MSC:  68Q05 05C85 92D50
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

Year of Publication

all top 3

Main Field

Software