Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds

Becchetti, Luca and Bonifaci, Vincenzo and Dirnberger, Michael and Karrenbauer, Andreas and Mehlhorn, Kurt
(2013) Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds.
In: ICALP '13 - International Colloquium on Automata Languages and Programming.
Conference: ICALP International Colloquium on Automata Languages and Programming

Full text not available from this repository.
Item Type: Conference or Workshop Item (A Paper) (Paper)
Conference: ICALP International Colloquium on Automata Languages and Programming
Depositing User: Sebastian Weisgerber
Date Deposited: 22 Feb 2018 11:11
Last Modified: 22 Feb 2018 16:19
URI: https://publications.cispa.saarland/id/eprint/1673

Actions

Actions (login required)

View Item View Item
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.