default search action
"Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds."
Luca Becchetti et al. (2013)
- Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn:
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. ICALP (2) 2013: 472-483
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.