A parallel bio-inspired shortest path algorithm
DOI10.1007/S00607-018-0621-XzbMATH Open1459.68063OpenAlexW2799815020WikidataQ129899765 ScholiaQ129899765MaRDI QIDQ2218449FDOQ2218449
Authors: Hilal Arslan, Murat Manguoglu 
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
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
Krylov subspace methodspreconditioningM-matrixPhysarum polycephalum\( \varDelta \)-steppingGauss-Seidel preconditionerparallel shortest pathsparse numerical linear algebra
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Graph theory (including graph drawing) in computer science (68R10) Preconditioners for iterative methods (65F08) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Title not available (Why is that?)
- Preconditioning techniques for large linear systems: A survey
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- M-matrix characterizations. I: nonsingular M-matrices
- Approximating Shortest Paths in Graphs
- Approximate shortest paths in weighted graphs
- Title not available (Why is that?)
- A mathematical model for adaptive transport network in path finding by true slime mold
- An Optimal Synchronizer for the Hypercube
- Title not available (Why is that?)
- Convergence of parallel multisplitting iterative methods for M-matrices
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- Near-Linear Time Construction of Sparse Neighborhood Covers
- \textit{Physarum} can compute shortest paths
- A bio-inspired algorithm for identification of critical components in the transportation networks
- Compact oracles for reachability and approximate distances in planar digraphs
- Shortest paths algorithms: Theory and experimental evaluation
- Title not available (Why is that?)
- Shortest paths in Euclidean graphs
- Determining approximate shortest paths on weighted polyhedral surfaces
- More on modifications and improvements of classical iterative schemes for \(M\)-matrices
- Physarum can compute shortest paths: a short proof
- Physarum can compute shortest paths: convergence proofs and complexity bounds
- 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
- Programmable reconfiguration of Physarum machines
- Title not available (Why is that?)
- Physarum can solve the shortest path problem on Riemannian surface mathematically rigorously
- Computing almost shortest paths (extended abstract)
- The preconditioned Gauss-Seidel method faster than the SOR method
- Preconditioned Gauss-Seidel type iterative method for solving linear systems
- Shortest path calculation in large road networks
- Compact roundtrip routing in directed networks
- Title not available (Why is that?)
- Single-source shortest paths with the parallel boost graph library
- Title not available (Why is that?)
- Δ-stepping: a parallelizable shortest path algorithm
- Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
Cited In (4)
Uses Software
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)
