Results 51 to 60 of about 218,121 (185)

The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm

Algorithms
In the obstacle grid map, due to the limitations in search direction imposed by classical path algorithms and meta-heuristic algorithms, the shortest paths are not the true shortest paths (TSPs) but rather the shortest grid paths (SGPs).
Yijie Zhang, Jizhou Chen
doaj   +1 more source

Evaluation of Shortest Paths in Road Network [PDF]

Pakistan Journal of Commerce and Social Sciences, 2009
Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based ...
Farrukh Shehzad, Muhammad Akbar Ali Shah
doaj  

Contact networks have small metric backbones that maintain community structure and are primary transmission subgraphs.

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, Alain Barrat, Luis M Rocha   +2 more
doaj   +1 more source

An Algorithm for Enumerating SRLG Diverse Path Pairs

Journal of Telecommunications and Information Technology, 2023
Telecommunication networks are intrinsically multi-layered, a single failure at a lower level usually corresponds to a multi-failure scenario at an upper layer.
Teresa Gomes, Jos ́e Craveirinha
doaj   +1 more source

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality

, 2014
We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights.
C Demetrescu, DR Karger, K Goel, LC Freeman, M Nasre, M Thorup, T Coffman, U Brandes   +7 more
core   +1 more source

Shortest Paths in Portalgons

, 2023
Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric.
Löffler, M., Ophelders, Tim, Silveira, Rodrigo Ignacio, Staals, Frank   +3 more
openaire   +8 more sources

A Multi Label Algorithm for K Shortest Paths Problem

Communications, 2009
The paper presents an algorithm for computing k shortest walks or k shortest paths in a directed graph G (V, A). The proposed algorithm can be applied for solving the k shortest paths problem in an undirected graph G (V, E), too, by transforming the ...
Stanislav Paluch
doaj   +1 more source

Speeding up shortest path algorithms

, 2012
Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in ...
A.V. Goldberg, C. Demetrescu, D. Karger, D.B. Johnson, E.W. Dijkstra, H.N. Gabow, M. Thorup, M.L. Fredman, S. Pettie, S. Pettie, T. Hagerup   +10 more
core   +1 more source

Understanding the Shortest Route Selection Behavior for Private Cars Using Trajectory Data and Navigation Information

Journal of Advanced Transportation, 2022
Traffic information and driving preference play critical roles in the route selection of drivers and further impact transport management in practice.
Shiguang Wang, Heng Ding, Zeyang Cheng
doaj   +1 more source

The Competition for Shortest Paths on Sparse Graphs [PDF]

, 2012
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion.
Saad, David, Yeung, Chi Ho
core   +2 more sources