Shortest path solvers. From software to wetware

DOI10.1007/978-3-319-77510-4MaRDI QIDQ1753985zbMATH OpenOpenAlexFDO

Authors

Publication date 30 May 2018

Published in Emergence, Complexity and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-77510-4

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Collections of articles of miscellaneous specific interest (00B15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Paths and cycles (05C38) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Cellular automata (computational aspects) (68Q80) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Recommendations

• The shortest-path problem. Analysis and comparison of methods
• Shortest paths algorithms: Theory and experimental evaluation
• scientific article; zbMATH DE number 1003284
• Shortest path methods: A unifying approach
• Shortest‐path methods: Complexity, interrelations and new propositions
• Shortest-path feasibility algorithms, an experimental evaluation
• Shortest-path algorithms: Taxonomy and annotation
• Shortest path feasibility algorithms: an experimental evaluation
• Computing almost shortest paths

Cited in

(2)

• A parallel bio-inspired shortest path algorithm
• Shortest-Path-Finder Algorithm in a Two-Dimensional Array of Nonlinear Electronic Circuits

This page was built for publication: Shortest path solvers. From software to wetware

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753985)