Results 41 to 50 of about 3,982 (139)
Системный анализ и прикладная информатикаIn this paper we consider two families of competing algorithms for finding the shortest paths between all pairs of vertices (APSP) in directed weighted large graphs with different edge densities: Dijkstra and Floyd-Warshall. For comparison, we have taken
A. A. Prihozhy, O. N. Karasik
doaj +1 more source
Научно-технический вестник информационных технологий, механики и оптикиThe computational demands of the shortest path algorithms on large-scale graphs with millions of vertices and edges pose significant challenges for serial implementations, often requiring hours of execution time even on powerful CPUs.
D. Bodra, S. Khairnar
doaj +1 more source
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
, 2016 We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges.
Abraham, Ittai +2 more
core +1 more source
DesimalWaste is defined as anything that is not utilized or discarded. Waste is not something that happens by itself; instead, it is a product of human activity. Unresolved problems are often caused by waste. Binjai City's waste problem is one example.
Dinda Permata Sari, Rina Filia Sari
doaj +1 more source
Floyd–Warshall Algorithm for Sparse Graphs
AlgorithmsThe Floyd–Warshall algorithm, which uses a classic dynamic programming approach, provides a solution to the all-pairs shortest paths problem. However, for sparse graphs, iteratively applying Dijkstra’s, or some other similar algorithm from each node ...
Dani Zugan, Rok Požar, Andrej Brodnik
doaj +1 more source
Tuning block-parallel all-pairs shortest path algorithm for efficient multi-core implementation
Системный анализ и прикладная информатика, 2022 Finding shortest paths in a weighted graph is one of the key problems in computer-science, which has numerous practical applications in multiple domains.
O. N. Karasik, A. A. Prihozhy
doaj +1 more source
Analisa dan Penerapan Algoritma Floyd Warshal untuk Optimalisasi Jalur Berbasis GPS [PDF]
, 2018 Makalah ini membuat tentang masalah dalam menentukan jalur terpendek atau terdekat menuju lokasi pelanggan yang memberikan keluhan, kemudian teknisi akan melakukan penugasan maintenance ke lokasi pelanggan.
Darmawan, R. (Rizki), Ghaniy, R. (Rajib)
core
Image Redundancy Filtering for Panorama Stitching
IEEE Access, 2020 In this paper, we designed a novel framework for massive image panorama stitching, which aims to resolve image redundancy, alignment error accumulation and perspective distortion accumulation of the stitching process.
Xin Wei +6 more
doaj +1 more source
Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
, 2016 The nested parallel (a.k.a. fork-join) model is widely used for writing parallel programs. However, the two composition constructs, i.e. "$\parallel$" (parallel) and "$;$" (serial), are insufficient in expressing "partial dependencies" or "partial ...
Dinh, David +2 more
core +1 more source
Multi-point path planning based on the algorithm of colony-particle swarm optimization
Tongxin xuebao, 2019 The problem of multi-point path planning is a NP-hard problem,which is equivalent to finding the shortest path of a starting point and some specific node.Aiming at the problem of multi-point path planning,a retrospective ant colony-particle swarm ...
Lijue LIU +3 more
doaj +2 more sources