Results 51 to 60 of about 46,824 (191)
Exact Distance Oracles for Planar Graphs [PDF]
, 2010 We present new and improved data structures that answer exact node-to-node distance queries in planar graphs. Such data structures are also known as distance oracles.
Mozes, Shay, Sommer, Christian
core +3 more sources
PENERAPAN ALGORITMA DIJKSTRA PADA APLIKASI JASA TRANSPORTASI ONLINE DI KOTA MEDAN
Al-Ulum, 2022 This study aims to determine the shortest route in the application of online transportation services which is the main attraction for entrepreneurs who want to start looking for their fortune in technology and transportation, given the enormous ...
abdul alfattah hidayah
doaj +1 more source
Multipath optimized link state routing for mobile ad hoc networks [PDF]
, 2011 International audienceMultipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to ...
Abolhasan +11 more
core +6 more sources
Dijkstra’s Algorithm on Semigraph
WSEAS TRANSACTIONS ON COMPUTER RESEARCHThe study of graph theory helps us in understanding the relationship between two nodes. Semigraphs are generalizations of graphs where the relationship occurs between more than two nodes. It provides solutions to issues with layout, matching, networking, optimization, etc.
Pranjal Sen +4 more
openaire +1 more source
Research on optimal emergency evacuation path for mine water inrush based on dynamic D-K algorithm
Meikuang AnquanAfter the occurrence of mine water inrush, choosing the appropriate emergency evacuation path is very important to reduce the casualty and the mine accident level.
Biao XIE +6 more
doaj +1 more source
Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue
Journal of King Saud University: Computer and Information Sciences, 2021 Dynamic shortest path algorithms are the ones which are used to accommodate the online sequence of update operations to the underlying graph topology and also facilitate the subsequent query operations.
Sunita, Deepak Garg
doaj +1 more source
New algorithms for the dual of the convex cost network flow problem with application to computer vision [PDF]
, 2007 Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem.
Kolmogorov, V., Shioura, A.
core
, 2017 Unmanned Surface Vehicle (USV) is a new type of intelligent surface craft, and global path planning is the key technology of USV research, which can reflect the intelligent level of USV.
Li, Baoan +3 more
core +1 more source
Transit Node Routing Reconsidered [PDF]
, 2013 Transit Node Routing (TNR) is a fast and exact distance oracle for road networks. We show several new results for TNR. First, we give a surprisingly simple implementation fully based on Contraction Hierarchies that speeds up preprocessing by an order of ...
D. Delling +9 more
core +2 more sources
Secured Wireless Communications Using Multiple Active and Passive Intelligent Reflecting Surfaces
IEEE Open Journal of the Communications SocietyThis paper presents a novel approach to secure wireless communications by integrating multiple Active and Passive Intelligent Reflecting Surfaces (MAMP-IRSs).
Apichart Nutchanat +2 more
doaj +1 more source