U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

Scalable method to find the shortest path in a graph with circuits of memristors

Published

Author(s)

Alice Mizrahi, thomas Marsh, Brian D. Hoskins, Mark D. Stiles

Abstract

Finding the shortest path in a graph has applications to a wide range of optimization problems. However, algorithmic methods scale with the size of the graph in terms of time and energy. We propose a method to solve the shortest path problem using circuits of nanodevices called memristors and validate it on graphs of different sizes and topologies. It is both valid for an experimentally derived memristor model and robust to device variability. The time and energy of the computation scale with the length of the shortest path rather than with the size of the graph, making this method particularly attractive for solving large graphs with small path lengths.
Citation
Physical Review Applied
Volume
10
Issue
6
Pub Type
Journals

Download Paper

https://doi.org/10.1103/PhysRevApplied.10.064035

Keywords

memristors, bio-inspired computing, maze, optimization, graph analysis, swarm intelligence
Artificial intelligence and Nanoelectronics

Citation

Mizrahi, A. , Marsh, T. , Hoskins, B. and Stiles, M. (2018), Scalable method to find the shortest path in a graph with circuits of memristors, Physical Review Applied, [online], https://doi.org/10.1103/PhysRevApplied.10.064035 (Accessed December 6, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created December 14, 2018, Updated December 18, 2018