Finding All Edges on any Smallest Route Connecting Two Nodes of a Directed Acyclic Graph Using Parallel Computing-Reference-Cited by-同舟云学术

Finding All Edges on any Smallest Route Connecting Two Nodes of a Directed Acyclic Graph Using Parallel Computing

Published:2022 Issue: Volume: Page:683-695
ISSN:2367-3370
Container-title:Innovations in Computer Science and Engineering
language:
Short-container-title:

Author:

Ahire Deepak^ORCID,Kamble Kiran^ORCID,Jadhav Omkar^ORCID,Katakdhond Shubham^ORCID

Publisher

Springer Singapore

Link

https://link.springer.com/content/pdf/10.1007/978-981-16-8987-1_73

Reference37 articles.

1. Ahire D, Jadhav O (2021) Commentary—methods to find all the edges on any of the shortest paths between two given nodes of a directed acyclic graph. Research Ideas And Outcomes, 7

2. Gross A (2012) Find all paths between two graph nodes. Stack Overflow. Retrieved 6 January 2021, from https://stackoverflow.com/a/9535898/7422352

3. DW (2015) Finding all paths between a set of vertices in a DAG. Comput Sci Stack Exchange (2015). Retrieved 11 February 2021, from https://cs.stackexchange.com/q/42043

4. Mancuso N (2015) Algorithm that finds the number of simple paths from s to t in G. Computer Science Stack Exchange. Retrieved 11 February 2021, from https://cs.stackexchange.com/a/3087/78734

5. Reitzig R (2019) Optimal algorithm to traverse all paths in the order of shortest path. Comput Sci Stack Exch. Retrieved 11 January 2021 from https://cs.stackexchange.com/q/19778

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimizing the Eﬃciency of Web Mining through Comparative Web Ranking Algorithms;VFAST Transactions on Software Engineering;2023-12-31