Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:916679
Jump to:navigation, search

DOI10.1016/0021-9991(90)90235-SzbMath0704.05033WikidataQ60179668 ScholiaQ60179668MaRDI QIDQ916679

Elsie Sterbin Gottlieb

Publication date: 1990

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


zbMATH Keywords

algorithmsimulationsfinding 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)


Related Items

A matrix-based approach to searching colored paths in a weighted colored multidigraph



Cites Work

  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:916679&oldid=12886216"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki