Approximation Algorithm for Shortest Path in Large Social Networks

Mensah, Dennis Nii Ayeh; Gao, Hui; Yang, Liang

doi:10.3390/a13020036

Cited by 8 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thirdly, all these computer packages do not input the network models directly before solving the problem, rather, only the numerical part of the data is extracted from the network and inputted for solving the network problem and also the solution of the network is not presented in the network-like form rather, in tables which destroys the beauty of the network. Hence the need for our GUI where network models can be inputted directly with the solution also in a network tree and the summary represented, which is the objectives of our research (Mensah et al, 2020) [7] . The computer package was developed using the C# programming language.…”

Section: ~ 2 ~mentioning

confidence: 99%

MS-MD-Shortest route pathfinder for multiple sources to multiple destinations of directed graph models

Tamber¹,

Ikpotokin²,

Okafor³

et al. 2021

Int. J. Comput. Programming Database Manage.

View full text Add to dashboard Cite

This paper presents a computer package that was developed to obtain the shortest route from the Multiple Sources to Multiple Destinations of Directed Graph Models of the Nigeria refineries to their deports located outside the refineries towns and the Nigeria roads network of motorable road b from multiple sources to multiple destinations directly without decomposing like in the case of the existing computer packages. The existing ones cannot solve the network problem of multiple sources to multiple destination (MSMD) directly but by first splitting the network into single sources to single destination networks and these networks are solved individually before superimposing into a single network manually. Also in the existing computer packages, Network data are not inputted directly before solving the problem, rather only the numerical part of the data is extracted from the network and inputted for solving the network problem and also the solution of the network is not presented in the network-like form rather, they are presented in tables which destroys the beauty of the network. Secondly, some of these computer packages, like Microsoft Excel, need to be reprogrammed before performing these tasks; these make solving such problems very hectic. Hence the need for simpler Graphic User Interface (MSMD-Shortest Route finder) that network models are inputted directly without tempering with the network, splitting the network nor reprogramming and also the solution are presented in a network tree with the summary, which is the objective of this research. The distances of the various roads in the Nigeria roads network were obtained using google map from google GPS and Nigeria Atlas map. The Optimal routes of the Nigeria refineries to their deports by road and Nigeria roads network of motorable road from multiple sources (coastal towns: Lagos, Port-Harcourt, Asaba/warri and Calabar) to multiple destinations (border towns: Katsina, Sokoto and Maiduguri) were obtained using MSMD-Shortest Route finder. The shortest routes obtained by using the MSMD-Shortest Route finder compares favorably with the existing ones and was found to be the best.

show abstract

Section: ~ 2 ~mentioning

confidence: 99%

MS-MD-Shortest route pathfinder for multiple sources to multiple destinations of directed graph models

Tamber¹,

Ikpotokin²,

Okafor³

et al. 2021

Int. J. Comput. Programming Database Manage.

View full text Add to dashboard Cite

show abstract

“…This paper descriptively brings out such a meaningful cluster of sensor nodes controlled by the respective control stations using edge-fixed geodetic sets, which are determined by an algorithm with polynomial time complexity. Calculation of geodetic paths and nodes on geodetic paths in this algorithm is achieved by Floyd Warshall algorithm [7,8] with complexity O(n 3 ).…”

Section: Introductionmentioning

confidence: 99%

Clustered Wireless Sensor Network in Precision Agriculture via Graph Theory

Bindu¹,

Titus²,

Dhanya³

2023

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

Food security and sustainable development is making a mandatory move in the entire human race. The attainment of this goal requires man to strive for a highly advanced state in the field of agriculture so that he can produce crops with a minimum amount of water and fertilizer. Even though our agricultural methodologies have undergone a series of metamorphoses in the process of a present smartagricultural system, a long way is ahead to attain a system that is precise and accurate for the optimum yield and profitability. Towards such a futuristic method of cultivation, this paper proposes a novel method for monitoring the efficient flow of a small quantity of water through the conventional irrigation system in cultivation using Clustered Wireless Sensor Networks (CWSN). The performance measure is simulated the creation of edge-fixed geodetic clusters using Mat lab's Cup-carbon tool in order to evaluate the suggested irrigation process model's performance. The findings of blocks 1 and 2 are assessed. Each signal takes just a little amount of energy to communicate, according to the performance. It is feasible to save energy while maintaining uninterrupted communication between nodes and cluster chiefs. However, the need for proper placement of a dynamic control station in WSN still exists for maintaining connectivity and for improving the lifetime fault tolerance of WSN. Based on the minimum edge fixed geodetic sets of the connected graph, this paper offers an innovative method for optimizing the placement of control stations. The edge-fixed geodetic cluster makes the network fast, efficient and reliable. Moreover, it also solves routing and congestion problems.

show abstract

“…Beranek and Remes analyzed the intensity distribution and behavior characteristics of selected nodes and selected participants in the tripartite network, which further realized the systematic analysis of more complex tripartite networks [7]. Mensah et al got rid of the limitations of small-scale networks and proposed an efficient and accurate shortest path algorithm for large-scale networks [8]. Džamić et al introduced a new community structure detection standard for complex networks.…”

Section: Introductionmentioning

confidence: 99%

Space-Time Evolution of Subway Vulnerability Based on Hypergraph Space

Lü

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

How to qualitatively and quantitatively evaluate the ability of the whole subway system to maintain the maximum normal operation has become a noteworthy topic. In this study, the hypergraph space structure of Nanjing subway network is used for research. This study uses the method of time-space evolution mechanism to dynamically and quantitatively analyze the gradual change characteristics of Nanjing subway system vulnerability under the influence of time and space. In addition, this study also makes static and dynamic comparative analysis on the vulnerability of a subway system by using connectivity rate and trip efficiency index, which provides new analysis methods and ideas for the study of a subway system network. The results show that although the overall structure of Nanjing’s subway network shows a loose trend, as Nanjing’s subway is still in a rapid development stage, it can be seen from the long-term planning of Nanjing’s subway that the construction of Nanjing’s subway ring line will be strengthened after the completion of the connection between the main city and the suburbs. Therefore, the vulnerability of the subway system should be reduced and the reliability will be improved.

show abstract

Approximation Algorithm for Shortest Path in Large Social Networks

Cited by 8 publications

References 13 publications

MS-MD-Shortest route pathfinder for multiple sources to multiple destinations of directed graph models

MS-MD-Shortest route pathfinder for multiple sources to multiple destinations of directed graph models

Clustered Wireless Sensor Network in Precision Agriculture via Graph Theory

Space-Time Evolution of Subway Vulnerability Based on Hypergraph Space

Contact Info

Product

Resources

About