Computing shortest paths in 2D and 3D memristive networks

Zhanyou Ye, Shi Hong Marcus Wu, Themistoklis Prodromakis

Global optimisation problems in networks often require shortest path length computations to determine the most efficient route. The simplest and most common problem with a shortest…