Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds
ICALP, 2013.

ICALP v2 2013
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-v2-2013-BecchettiBDKM,
	author        = "Luca Becchetti and Vincenzo Bonifaci and Michael Dirnberger and Andreas Karrenbauer and Kurt Mehlhorn",
	booktitle     = "{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, Part II}",
	doi           = "10.1007/978-3-642-39212-2_42",
	isbn          = "978-3-642-39211-5",
	pages         = "472--483",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds}",
	volume        = 7966,
	year          = 2013,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.