Efficient algorithm for finding the influential nodes using local relative change of average shortest path

2021 ◽  
pp. 126708
Author(s):  
Koduru Hajarathaiah ◽  
Murali Krishna Enduri ◽  
Satish Anamalamudi
Keyword(s):  
Shortest Path ◽  
Efficient Algorithm ◽  
Influential Nodes ◽  
Relative Change

An efficient algorithm for dynamic shortest path tree update in network routing

2007 ◽  
Vol 9 (4) ◽  
pp. 499-510 ◽  
Author(s):  
Bin Xiao ◽  
Jiannong Cao ◽  
Zili Shao ◽  
Edwin H.-M. Sha
Keyword(s):  
Shortest Path ◽  
Efficient Algorithm ◽  
Network Routing ◽  
Shortest Path Tree

An efficient algorithm to find next-to-shortest path on permutation graphs

2008 ◽  
Vol 31 (1-2) ◽  
pp. 369-384 ◽  
Author(s):  
Sambhu Charan Barman ◽  
Sukumar Mondal ◽  
Madhumangal Pal
Keyword(s):  
Shortest Path ◽  
Efficient Algorithm ◽  
Permutation Graphs

An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles

1989 ◽  
Vol 111 (3) ◽  
pp. 433-436 ◽  
Author(s):  
J. Khouri ◽  
K. A. Stelson
Keyword(s):  
Shortest Path ◽  
Efficient Algorithm ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Three Dimensions ◽  
Minimum Length ◽  
Precise Location ◽  
Computer Storage ◽  
Polyhedral Obstacles ◽  
Three Dimensional Space

An algorithm to find the shortest path between two specified points in three-dimensional space in the presence of polyhedral obstacles is described. The proposed method iterates for the precise location of the minimum length path on a given sequence of edges on the obstacles. The iteration procedure requires solving a tri-diagonal matrix at each step. Both the computer storage and the number of computations are proportional to n, the number of edges in the sequence. The algorithm is stable and converges for the general case of any set of lines, intersecting, parallel or skew.

Physarum-Inspired Applications in Graph-Optimization Problems

2015 ◽  
Vol 25 (01) ◽  
pp. 1540005 ◽  
Author(s):  
Xiaoge Zhang ◽  
Sankaran Mahadevan ◽  
Yong Deng
Keyword(s):  
Shortest Path ◽  
Real World ◽  
Physarum Polycephalum ◽  
Optimization Problems ◽  
Rapid Development ◽  
Shortest Path Tree ◽  
The Past ◽  
Graph Optimization ◽  
Real World Applications ◽  
Influential Nodes

In the past decade, we have witnessed the rapid development of a increasing body of research focused on Physarum polycephalum, which has been employed to solve many complicated problems in real-world applications. In this paper, we give an overview towards the developments of Physarum-inspired models for graph-optimization problems. Specifically, we reported the applications of Physarum in the following graph-optimization problems: influential nodes identification, shortest path tree problem, biobjective shortest path problem, improved Physarum algorithm and approximating the transport network.

Sign in / Sign up

Export Citation Format

Share Document