Quoc, Chien Tran and Van, Hung Ho (2017) Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network. EAI Endorsed Transactions on Industrial Networks and Intelligent Systems.
![[thumbnail of 25586.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "25586.pdf")
PDF
25586.pdf
Download (824kB)
Abstract
The shortest path finding algorithm is used in many problems on graphs and networks. This article will introduce the algorithm to find the shortest path between two vertices on the extended graph. Next, the algorithm finds the shortest path between the pairs of vertices on the extended graph with mu
| Item Type: | Article |
|---|---|
| Date Deposited: | 04 Mar 2026 11:05 |
| Last Modified: | 12 Apr 2026 08:15 |
| URI: | http://eprints.eai.eu/id/eprint/16915 |
Actions (login required)
- View Item