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)

zbMATH Keywords

simulationsalgorithmfinding all the paths between two nodes in a graph

Mathematics Subject Classification ID

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

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)

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

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)