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.

Actions

Actions (login required)

View Item View Item