Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds.
| Autor: | Becchetti, Luca, Bonifaci, Vincenzo, Dirnberger, Michael, Karrenbauer, Andreas, Mehlhorn, Kurt |
|---|---|
| Zdroj: | Automata, Languages & Programming (9783642392115); 2013, p472-483, 12p |
| Databáze: | Complementary Index |
| Externí odkaz: |
|