Results 71 to 80 of about 3,683 (185)
Bidirectional Dijkstra’s Algorithm is Instance-Optimal
Fixed a bug in the bidirectional search pseudocode where e_mid was updated even if $\mu$ wasn't. Fixed a typo in the proof of Theorem 3: changed all $v_1u_2$ to $u_2v_1$.
Haeupler, Bernhard +4 more
openaire +2 more sources
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
Journal of Engineering Science and Military TechnologiesThis paper introduces TAR-RERA (Tactical Adaptive Routing with Reinforced Energy and Risk Awareness), a novel routing algorithm designed for ad-hoc communication in hostile or dynamic environments such as battlefield zones and disaster-response ...
Nadhir ABDULKHALEQ +2 more
doaj +1 more source
Geophysical Research Letters, Volume 53, Issue 14, 28 July 2026.Abstract Accurately predicting solute transport remains a central challenge in hydrogeology due to limited data and multiscale subsurface heterogeneity. Fractional Brownian motion (fBm) is widely used to model the logarithm of hydraulic conductivity fields.
Binhao Li +2 more
wiley +1 more source
A Coalgebraic Dijkstra Algorithm
The Dijkstra algorithm is a classical method for solving the shortest path problem on weighted graphs. There are several variations of the Dijkstra algorithm, including algorithms for the widest path problem and for two-player games. In this paper, we introduce the coalgebraic shortest path problem (CSPP), a unifying framework for a broad class of ...
Sanada, Takahiro +3 more
openaire +2 more sources
Intelligent vehicle scheduling in open-pit mines based on 5G antenna and improved Dijkstra algorithm
Gong-kuang zidonghuaComplex terrains such as deep pits and high slopes in open-pit mines cause physical signal blockage and multipath fading. Furthermore, existing path-planning algorithms tend to result in unstable vehicle trajectories or congestion due to local optima ...
CHEN Xiaolei, CHEN Liufang, WANG Jie
doaj +1 more source
Dijkstra’s Self-Stabilizing Algorithm in Unsupportive Environments
, 2001 12 pages, uses eepic ...
Shlomi Dolev, Ted Herman
openaire +2 more sources
PENCARIAN RUTE TERPENDEK DALAM DUNIA 3 DIMENSI BERDASARKAN ALGORITMA DIJKSTRA
JUTI: Jurnal Ilmiah Teknologi Informasi, 2008 Virtual reality is one of the favorite application that very liked by peoples. Vitual reality also used in many games application in order to show the imitation of real world. Recently, virtual reality still imperfect due to shortest path problem.
Ahmad Hoirul Basori, Andi Tenriawaru
doaj +1 more source
Finding the Nearest Blood Donors using Dijkstra Algorithm
SISFORMA, 2019 Now-a-days frequent mishaps like the road accident or other life-risking accident leading to operational emergencies are increasing day by day and the blood donor for such victims or patients are very hard to find in a short period.
Md. Sabir Hossain +3 more
doaj +1 more source
Composite Inertia Weighted APSO for Autonomous Vehicle Path Planning
IEEE Open Journal of Vehicular TechnologyEfficient path planning is essential for autonomous vehicle navigation. This paper proposes a Composite Inertia Weighted Adaptive Particle Swarm Optimization (APSO) algorithm to improve convergence reliability and solution quality.
Muhammad Haris, Yifang Shi, Haewoon Nam
doaj +1 more source