An algorithm to find all paths between two nodes in a graph

DOI10.1016/0021-9991(90)90235-SMaRDI QIDQ916679zbMATH OpenWikidataFDO

Authors Elsie Sterbin Gottlieb

Publication date 1990

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-9991(90)90235-S

zbMATH Keywords

algorithmfinding all the paths between two nodes in a graphsimulations

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10)

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.

Recommendations

• scientific article; zbMATH DE number 599010
• Paths through K-specified edges in a linear graph
• A parallel shortest path algorithm
• A two-criterion lexicographic algorithm for finding all shortest paths in networks
• On fast path-finding algorithms in AND-OR graphs

Cited in

(3)

• Faster algorithm to find anti-risk path between two nodes of an undirected graph
• Finding a contra-risk path between two nodes in undirected graphs
• A matrix-based approach to searching colored paths in a weighted colored multidigraph

This page was built for publication: An algorithm to find all paths between two nodes in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916679)