Results 61 to 70 of about 550,853 (271)
INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019 The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination.
S. Behzadi, M. Kolbadinejad
doaj +1 more source
Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
, 2007 During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy.
Bauer, Reinhard +2 more
openaire +4 more sources
Fuzzy Shortest Path Problem Based on Level š-Triangular LR Fuzzy Numbers
Advances in Fuzzy Systems, 2012 In problems of graphs involving uncertainties, the fuzzy shortest path problem is one of the most studied topics, since it has a wide range of applications in different areas and therefore deserves special attention.
S. Elizabeth, L. Sujatha
doaj +1 more source
Comparison Analysis of Graph Theory Algorithms for Shortest Path Problem
Jurnal Sisfokom, 2023 The Sumba region, Indonesia, is known for its extraordinary natural beauty and unique cultural richness. There are 19 interesting tourist attractions spread throughout the area, but tourists often face difficulties in planning efficient visiting routes ...
Yosefina Finsensia Riti +2 more
doaj +1 more source
On the complexity of the shortest-path broadcast problem
Discrete Applied Mathematics, 2016 We study the shortest-path broadcast problem in graphs and digraphs, where a message has to be transmitted from a source node s to all the nodes along shortest paths, in the classical telephone model. For both graphs and digraphs, we show that the problem is equivalent to the broadcast problem in layered directed graphs.
CRESCENZI, PIERLUIGI +6 more
openaire +2 more sources
The Rough Interval Shortest Path Problem
, 2021 The shortest path problem is one of the most popular network optimization problems and it is of great importance in areas such as transportation, network design or telecommunications. This model deals with determining a minimum weighted path between a pair of nodes of a given network.
Moghanni A., Pascoal M.
openaire +3 more sources
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 +10 more
core +1 more source
A machine learning approach for predicting human shortest path task performance
Visual Informatics, 2022 Finding a shortest path for a given pair of vertices in a graph drawing is one of the fundamental tasks for qualitative evaluation of graph drawings.
Shijun Cai +4 more
doaj
The on-line shortest path problem under partial monitoring [PDF]
, 2007 The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, a decision maker has to choose in each round of a game a ...
Gyorgy, Andras +3 more
core +2 more sources
The Algorithm for Solving Shortest-Path Problems Based on Electrical Circuit Laws [PDF]
Muį¹ÄliĢÄt-i MudÄ«riyyat-i į¹¢anĢatÄ«, 2011 Shortest-path problem is one of the well-known optimization problems that has been studied by many scientists in recent years. Applications of this problem such as transportation and communication are generally solved by Dijkstra's Algorithm (Labeling ...
Ali Khatami Firoozabadi +2 more
doaj