Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network
Journal Title: EAI Endorsed Transactions on Industrial Networks and Intelligent Systems - Year 2017, Vol 4, Issue 11
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
- EP ID EP46062
- DOI http://dx.doi.org/10.4108/eai.21-12-2017.153499
- Views 302
- Downloads 0
Attribution of Cyber Attacks on Industrial Control Systems
In order to deter or prosecute for cyber attacks on industrial control systems it is necessary to assign attribution to the attacker and define the type of attack so that international law enforcement agencies or nationa...
Natural Disaster and Environmental Monitoring System for Smart Cities: Design and Installation Insights
Climate change is mainly caused by human activities. Consequently, natural disasters such as flooding, storm, and drought are attacking people at high frequency and extreme damage. Besides, many megacities have been facin...
Gatewaying theWireless Sensor Networks
With the dev elopmen t of Internet of Things (IoT), bridging wireless sensor netw orks (WSNs) with other netw orks has become importan t. We divide bridging solutions into tw o categ ories: the hardw are solutions and th...
On the Experimental Evaluation of Vehicular Networks: Issues, Requirements and Methodology Applied to a Real Use Case
One of the most challenging fields in vehicular communications has been the experimental assessment of protocols and novel technologies. Researchers usually tend to simulate vehicular scenarios and/or partially validate...
Outage Performance of Cooperative Cognitive Radio Networks under Joint Constraints of Co-Channel Interference, Intercept Probability and Hardware Imperfection
This paper evaluates outage probability (OP) of a cooperative underlay cognitive radio network in the presence of a passive secondary eavesdropper under joint impacts of limited interference from a primary network and ha...