NIST · ИТ · 025ec0dcac307bdd4e8c
Scalable method to find the shortest path in a graph with circuits of memristors
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
NIST · ИТОфициальный источник · 2018-12-14
{
"title_en": "Scalable method to find the shortest path in a graph with circuits of memristors",
"designation": "",
"series": "",
"status": "",
"date": "2018-12-14",
"date_original": "December 14, 2018",
"url": "https://www.nist.gov/publications/scalable-method-find-shortest-path-graph-circuits-memristors",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Alice Mizrahi , thomas Marsh, Brian D. Hoskins , Mark D. Stiles",
"abstract_excerpt_en": "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",
"id": "025ec0dcac307bdd4e8c",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Scalable method to find the shortest path in a graph with circuits of memristors",
"designation": "",
"series": "",
"status": "",
"date": "2018-12-14",
"date_original": "December 14, 2018",
"url": "https://www.nist.gov/publications/scalable-method-find-shortest-path-graph-circuits-memristors",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Alice Mizrahi , thomas Marsh, Brian D. Hoskins , Mark D. Stiles",
"abstract_excerpt_en": "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"
}
],
"translation_state": "none"
}