A parallel bio-inspired shortest path algorithm
From MaRDI portal
Publication:2218449
Recommendations
- Physarum can compute shortest paths: convergence proofs and complexity bounds
- \textit{Physarum} can compute shortest paths
- \textit{Physarum} can compute shortest paths
- Shortest path solvers. From software to wetware
- An anticipation mechanism for the shortest path problem based onPhysarum polycephalum
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 1305103 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2119743 (Why is no real title available?)
- scientific article; zbMATH DE number 5937963 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- scientific article; zbMATH DE number 3415384 (Why is no real title available?)
- A bio-inspired algorithm for identification of critical components in the transportation networks
- A mathematical model for adaptive transport network in path finding by true slime mold
- A note on two problems in connexion with graphs
- An Optimal Synchronizer for the Hypercube
- Approximate shortest paths in weighted graphs
- Approximating Shortest Paths in Graphs
- Compact oracles for reachability and approximate distances in planar digraphs
- Compact roundtrip routing in directed networks
- Computing almost shortest paths (extended abstract)
- Convergence of parallel multisplitting iterative methods for M-matrices
- Determining approximate shortest paths on weighted polyhedral surfaces
- M-matrix characterizations. I: nonsingular M-matrices
- More on modifications and improvements of classical iterative schemes for \(M\)-matrices
- Near-Linear Time Construction of Sparse Neighborhood Covers
- On \(M\)-functions and their application to nonlinear Gauss-Seidel iterations and to network flows
- Physarum Optimization: A Biology-Inspired Algorithm for the Steiner Tree Problem in Networks
- Physarum can compute shortest paths: a short proof
- Physarum can compute shortest paths: convergence proofs and complexity bounds
- Physarum can solve the shortest path problem on Riemannian surface mathematically rigorously
- Preconditioned Gauss-Seidel type iterative method for solving linear systems
- Preconditioning techniques for large linear systems: A survey
- Programmable reconfiguration of Physarum machines
- Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
- Shortest path calculation in large road networks
- Shortest paths algorithms: Theory and experimental evaluation
- Shortest paths in Euclidean graphs
- Single-source shortest paths with the parallel boost graph library
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- The preconditioned Gauss-Seidel method faster than the SOR method
- \textit{Physarum} can compute shortest paths
- Δ-stepping: a parallelizable shortest path algorithm
Cited in
(4)
This page was built for publication: A parallel bio-inspired shortest path algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218449)
