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

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...

Merging OMG Standards in a General Modeling, Transformation, and Simulation Framework

Test-driven Agile Simulation (TAS) is a general-purpose approach that combines model-driven engineering, simulation, and testing techniques to improve overall quality for the development process. TAS focuses on the const...

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...

Stochastic-Based Power Consumption Analysis for Data Transmission in Wireless Sensor Networks

Wireless sensor networks (WSNs) provide a lot of emerging applications. They suffer from some limitations such as energy constraints and cooperative demands essential to perform sensing or data routing. The networks coul...

Data network related to an object manufacturing inside of exerted Intelligent System

Most of today’s information systems are not fully integrated. Companies, suppliers, and customers are rarely closely linked. Functions within a chain from the enterprise to the shop floor level are not fully integrated....

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