Physarum can compute shortest paths: a short proof (Q1941685)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6147756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Physarum can compute shortest paths: a short proof |
scientific article; zbMATH DE number 6147756 |
Statements
Physarum can compute shortest paths: a short proof (English)
0 references
21 March 2013
0 references
combinatorial problems
0 references
natural algorithm
0 references
shortest path
0 references
Thomson's principle
0 references
0.924868106842041
0 references
0.9233769178390504
0 references
0.9217560887336732
0 references
0.8248552083969116
0 references
0.8208096623420715
0 references
