Results 1 to 10 of about 47,764 (259)
Shortest Paths in Multiplex Networks [PDF]
Scientific Reports, 2017 The shortest path problem is one of the most fundamental networks optimization problems. Nowadays, individuals interact in extraordinarily numerous ways through their offline and online life (e.g., co-authorship, co-workership, or retweet relation in ...
Saeed Ghariblou +3 more
doaj +4 more sources
On the Utilization of Shortest Paths in Complex Networks [PDF]
IEEE Access, 2021 Considerable effort has been devoted to the study of network structures and connectivity patterns and their influence on network dynamics. A widely used assumption in network analysis models is that traffic follows the shortest paths connecting pairs of ...
Hend Alrasheed
doaj +2 more sources
Approximation Algorithm for Shortest Path in Large Social Networks
Algorithms, 2020 Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall’s algorithms are limited to small networks due to computational complexity and cost.
Dennis Nii Ayeh Mensah +2 more
doaj +3 more sources
Calculation of shortest path on Fermatean Neutrosophic Networks [PDF]
Neutrosophic Sets and Systems, 2023 The shortest path (SP) problem (SPP) has several applications in graph theory. It can be used to calculate the distance between the provided initial and final vertex in a network.
Prasanta Kumar Raut +3 more
doaj +1 more source
PLoS Computational Biology, 2023 The structure of social networks strongly affects how different phenomena spread in human society, from the transmission of information to the propagation of contagious diseases.
Rion Brattig Correia +2 more
doaj +2 more sources
Shortest Directed Networks in the Plane [PDF]
Graphs and Combinatorics, 2020 AbstractGiven a set of sources and a set of sinks as points in the Euclidean plane, adirected networkis a directed graph drawn in the plane with a directed path from each source to each sink. Such a network may contain nodes other than the given sources and sinks, called Steiner points.
Alastair Maxwell, Konrad J. Swanepoel
openaire +2 more sources
TD-H2H: Shortest Path Query on Time-Dependent Graphs [PDF]
Jisuanji kexue yu tansuo, 2023 A shortest path query on road networks is a fundamental problem, which has been studied widely. Existing studies usually model road networks as a static graph and query the path with the shortest distance between given vertices.
LI Xinling, WANG Yishu, YUAN Ye, GU Xiang, WANG Guoren
doaj +1 more source
Nature Communications, 2023 Shortest paths between the nodes of complex networks are challenging to obtain if the information on network structure is incomplete. Here the authors show that the shortest paths are geometrically localized in hyperbolic representations of networks, and
Maksim Kitsak +7 more
doaj +1 more source
Fast and scalable routing protocols for data center networks
Digital Communications and Networks, 2023 Data center networks may comprise tens or hundreds of thousands of nodes, and, naturally, suffer from frequent software and hardware failures as well as link congestions. Packets are routed along the shortest paths with sufficient resources to facilitate
Mihailo Vesović +2 more
doaj +1 more source
Planning wireless networks by shortest path [PDF]
Computational Optimization and Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlo Mannino +2 more
openaire +6 more sources