An algorithm to find all paths between two nodes in a graph
type: Item
instance of: scholarly article
title: An algorithm to find all paths between two nodes in a graph
zbMATH Open document ID: 0704.05033
DOI: 10.1016/0021-9991(90)90235-S
author: Elsie Sterbin Gottlieb
published in: Journal of Computational Physics
publication date: 1990-01-01T00:00:00Z
review text: In this note the authors present an algorithm for finding all the paths between two nodes in a graph. The algorithm is a well-known application of the depth-first search strategy and the authors report on some simulations they performed (on aqueous systems) using several kinds of computer systems.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4154482
zbMATH Keywords: algorithm
zbMATH Keywords: finding all the paths between two nodes in a graph
zbMATH Keywords: simulations
Wikidata QID: Q60179668
reviewed by: Giora Slutzki
MaRDI profile type: Publication
cites work: Q3731041
description: scientific article; zbMATH DE number 4154482