Results 1 to 10 of about 569,188 (376)

Computing shortest paths in 2D and 3D memristive networks

, 2013
Global optimisation problems in networks often require shortest path length computations to determine the most efficient route. The simplest and most common problem with a shortest path solution is perhaps that of a traditional labyrinth or maze with a ...
Prodromakis, Themistoklis, Wu, Shi Hong Marcus, Ye, Zhanyou   +2 more
core  

A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs

, 2011
We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an $n\times n$ 0-1 matrix $C,$ let $K_{C}$ be the complete weighted graph on the rows of $C$ where the weight of an edge ...
Lingas, Andrzej, Sledneu, Dzmitry
core   +1 more source

Role of magnetic skyrmions for the solution of the shortest path problem [PDF]

, 2021
Riccardo Tomasello, A. Giordano, F. Garescì, Giulio Siracusano, S. De, Caterina Ciminelli, Mario Carpentieri, Giovanni Finocchio   +7 more
openalex   +1 more source

Maximal buttonings of trees

Discussiones Mathematicae Graph Theory, 2014
A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1 ...
Short Ian
doaj   +1 more source

Implementation of Circle-Breaking Algorithm on Fermatean Neutrosophic Graph to discover Shortest Path [PDF]

Neutrosophic Sets and Systems
In many scientific domains, there is a growing interest in the shortest path problem. Traffic routes that can be precisely defined become arbitrary due to the damage that natural catastrophes inflict on roads and bridges.
S. krishna Prabha, Said Broumi, Souhail Dhouib, Mohamed Talea   +3 more
doaj   +1 more source

Distributed algorithms from arboreal ants for the shortest path problem. [PDF]

Proc Natl Acad Sci U S A, 2023
Garg S, Shiragur K, Gordon DM, Charikar M.   +3 more
europepmc   +1 more source

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm

, 2017
Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core  

Solving the Robust Shortest Path Problem with Multimodal Transportation

Mathematics
This paper explores the challenges of finding robust shortest paths in multimodal transportation networks. With the increasing complexity and uncertainties in modern transportation systems, developing efficient and reliable routing strategies that can ...
Jinzuo Guo, Tianyu Liu, Guopeng Song, Bo Guo   +3 more
doaj   +1 more source

On the shortest path problem of uncertain random digraphs. [PDF]

Soft comput, 2022
Li H, Zhang K.
europepmc   +1 more source

A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem [PDF]

, 2022
Mohammad Anagreh, Peeter Laud
openalex   +1 more source