\textit{Physarum} can compute shortest paths
From MaRDI portal
Publication:5743394
Recommendations
Cites work
- A mathematical model for adaptive transport network in path finding by true slime mold
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computational ability of cells based on cell dynamics and adaptability
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3484411 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- Mathematical analysis to an adaptive network of the plasmodium system
- Natural algorithms
- Physarum can solve the shortest path problem on Riemannian surface mathematically rigorously
- Rules for biologically inspired adaptive network design
Cited in
(28)- \textit{Physarum polycephalum} assignment: a new attempt for fuzzy user equilibrium
- Physarum can compute shortest paths: a short proof
- On the convergence time of a natural dynamics for linear programming
- A Laplacian approach to _1-norm minimization
- Physarum-inspired multi-commodity flow dynamics
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence
- A parallel bio-inspired shortest path algorithm
- Convergence of the non-uniform directed physarum model
- A new multi-agent system to simulate the foraging behaviors of \textit{Physarum}
- An algorithmic approach to collective behavior
- \textit{Physarum} solver: a bio-inspired method for sustainable supply chain network design problem
- The ANTS problem
- Two results on slime mold computations
- Mathematical analysis to an adaptive network of the plasmodium system
- \textit{Physarum} can compute shortest paths
- An anticipation mechanism for the shortest path problem based on \textit{Physarum polycephalum}
- Leader election and shape formation with self-organizing programmable matter
- Physarum can solve the shortest path problem on Riemannian surface mathematically rigorously
- Natural algorithms for flow problems
- \textit{Physarum}-inspired applications in graph-optimization problems
- Towards a stationary Monge-Kantorovich dynamics: the Physarum Polycephalum experience
- Numerical approximation of nonhomogeneous boundary conditions on networks for a hyperbolic system of chemotaxis modeling the Physarum dynamics
- On the convergence time of a natural dynamics for linear programming
- Universal coating for programmable matter
- Physarum can compute shortest paths: convergence proofs and complexity bounds
- If BZ medium did spanning trees these would be the same trees as \textit{Physarum} built
- Multistate network model for the pathfinding problem with a self-recovery property
- Failure to the shortest path decision of an adaptive transport network with double edges in Plasmodium system
This page was built for publication: \textit{Physarum} can compute shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743394)
