© 2018

# Shortest Path Solvers. From Software to Wetware

- Editors
- (view affiliations)

## Benefits

Comprehensively addresses the famous problem of shortest path solving in the context of computer science, network theory, operational systems, swarm robotics, and graph theory

Presents novel and unique algorithms of solving shortest problems in massively parallel cellular automaton machines, graphs populated with mobile automata, and the imitated foraging behaviour of slime moulds

Discusses unconventional prototypes of experimental laboratory shortest path solvers using chemical systems, electrical current, single living cells, and plants

Includes unique contributions prepared by the world’s leading experts in computer science, engineering, applied mathematics, chemistry, physics, and biology

Richly illustrated: its wealth of graphical examples will appeal not only to scientists but also to engineers, industry representatives, and the general public

- 6 Citations
- 12k Downloads

Part of the Emergence, Complexity and Computation book series (ECC, volume 32)