Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network

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 multiple weights is developed. Then, the shortest path finding algorithms is used to find the maximum flow on the multicommodity multicost extended network is developed in the article [12].

Authors and Affiliations

Chien Tran Quoc, Hung Ho Van

Keywords

Related Articles

Tele-Monitoring the Battery of an Electric Vehicle

Nowadays, transportation is one of the main air pollution sources and has a significant impact on human health and environmental quality. The electric vehicle is a zero emission vehicle powered by an electric motor with...

Extreme Value Distributions in Hydrological Analysis in the Mekong Delta: A Case Study in Ca Mau and An Giang Provinces, Vietnam

Climate change poses a critical risk to the sustainable development of many regions in Vietnam, especially in the Mekong River. In this paper, we show the specific extreme value distributions of rainfall, flow, and crest...

TiPeNeSS: A Timed Petri Net Simulator Software with Generally Distributed Firing Delays

Performance analysis can be carried out in several ways, especially in case of Markovian models. In order to interpret high level of abstraction, we often use modeling tools like timed Petri nets (TPNs). Although some su...

Information seeking behaviour and purchasing decision: case study in digital cameras

This case study explores the information seeking behaviour of digital camera consumers based on Assael’s consumer information acquisition and processing model. 135 responses were received from potential target group who...

Security Issues in ProtoGENI

Network security consists of primary concerns in future Internet development due to the ever increasing threats to current Internet. ProtoGENI is a federated testbed facility supporting slice-based experiments to manage,...

Download PDF file
  • EP ID EP46062
  • DOI http://dx.doi.org/10.4108/eai.21-12-2017.153499
  • Views 290
  • Downloads 0

How To Cite

Chien Tran Quoc, Hung Ho Van (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, 4(11), -. https://europub.co.uk/articles/-A-46062