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

Fundamental Approach for Analysis of Dynamic Characteristics of Fixtures

Present work is aimed at research of locating and clamping process of prismatic parts in fixtures during the machining on drilling-milling-boring machines. The fundamental approach for developing mathematical modeling of...

Outage Probability of Vehicular Networks under Unreliable Backhaul

This paper presents for the first time a heterogeneous vehicular model with multiple moving small cells and a moving receiver with unreliable backhaul. In this system, a macro-base station connects to multiple moving smal...

Security and Privacy in Online Social Networks: A Survey

The Online Social Networks (OSN) open a new vista serving millions of users and have reshaped the way people interacts. Unfortunately these networks are an emerging platform for cybercrimes such as sending malicious URLs...

Smart Grid Attacks and Countermeasures

The term “Smart Grid” has been coined and used for several years to describe the efforts of the current power grid modernization effort. This effort plans to introduce self-healing, energy efficiency, reliability, and se...

Multi-Radio 5G Architecture for Connected and Autonomous Vehicles: Application and Design Insights

Connected and Autonomous Vehicles (CAVs) will play a crucial role in next-generation Cooperative Intelligent Transportation Systems (C-ITSs). Not only is the information exchange fundamental to improve road safety and ef...

Download PDF file
  • EP ID EP46062
  • DOI http://dx.doi.org/10.4108/eai.21-12-2017.153499
  • Views 303
  • 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