A parallel bio-inspired shortest path algorithm
DOI10.1007/s00607-018-0621-xzbMath1459.68063OpenAlexW2799815020WikidataQ129899765 ScholiaQ129899765MaRDI QIDQ2218449
Publication date: 15 January 2021
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-018-0621-x
preconditioningGauss-Seidel preconditionerKrylov subspace methodsM-matrixPhysarum polycephalum\( \varDelta \)-steppingparallel shortest pathsparse numerical linear algebra
Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A bio-inspired algorithm for identification of critical components in the transportation networks
- Approximate shortest paths in weighted graphs
- Convergence of parallel multisplitting iterative methods for M-matrices
- The preconditioned Gauss-Seidel method faster than the SOR method
- Preconditioned Gauss-Seidel type iterative method for solving linear systems
- Programmable reconfiguration of Physarum machines
- Shortest paths in Euclidean graphs
- M-matrix characterizations. I: nonsingular M-matrices
- Shortest path calculation in large road networks
- Preconditioning techniques for large linear systems: A survey
- More on modifications and improvements of classical iterative schemes for \(M\)-matrices
- Shortest paths algorithms: Theory and experimental evaluation
- Physarum can compute shortest paths: a short proof
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- A mathematical model for adaptive transport network in path finding by true slime mold
- On \(M\)-functions and their application to nonlinear Gauss-Seidel iterations and to network flows
- \textit{Physarum} can compute shortest paths
- Physarum Optimization: A Biology-Inspired Algorithm for the Steiner Tree Problem in Networks
- Determining approximate shortest paths on weighted polyhedral surfaces
- Approximating Shortest Paths in Graphs
- Near-Linear Time Construction of Sparse Neighborhood Covers
- An Optimal Synchronizer for the Hypercube
- Compact roundtrip routing in directed networks
- Δ-stepping: a parallelizable shortest path algorithm
- Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
- Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds
- Compact oracles for reachability and approximate distances in planar digraphs
- Computing almost shortest paths
This page was built for publication: A parallel bio-inspired shortest path algorithm
