Investigation of autonomous multi-UAV systems for target detection in distributed environment: Current developments and open challenges
Uncrewed aerial vehicles (UAVs), also known as drones, are ubiquitous and their use cases
extend today from governmental applications to civil applications such as the agricultural …
extend today from governmental applications to civil applications such as the agricultural …
FastGR: Global Routing on CPU–GPU With Heterogeneous Task Graph Scheduler
Running time is a key metric across the standard physical design flow stages. However, with
the rapid growth in design sizes, routing runtime has become the runtime bottleneck in the …
the rapid growth in design sizes, routing runtime has become the runtime bottleneck in the …
Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph
S Yang, X Liu, Y Wang, X He, G Tan - Proceedings of the 37th …, 2023 - dl.acm.org
Finding the All-Pairs Shortest Paths (APSP) in a graph is the key for various domains.
Motivated by the graphs are sparse in most real-world applications, we store the whole …
Motivated by the graphs are sparse in most real-world applications, we store the whole …
A supernodal all-pairs shortest path algorithm
We show how to exploit graph sparsity in the Floyd-Warshall algorithm for the all-pairs
shortest path (Apsp) problem. Floyd-Warshall is an attractive choice for Apsp on high …
shortest path (Apsp) problem. Floyd-Warshall is an attractive choice for Apsp on high …
Efficient parallel algorithms for betweenness-and closeness-centrality in dynamic graphs
Finding the centrality measures of nodes in a graph is a problem of fundamental importance
due to various applications from social networks, biological networks, and transportation …
due to various applications from social networks, biological networks, and transportation …
[HTML][HTML] Original optimal method to solve the all-pairs shortest path problem: Dhouib-matrix-ALL-SPP
S Dhouib - Data Science and Management, 2024 - Elsevier
The All-pairs shortest path problem (ALL-SPP) aims to find the shortest path joining all the
vertices in a given graph. This study proposed a new optimal method, Dhouib-matrix-ALL …
vertices in a given graph. This study proposed a new optimal method, Dhouib-matrix-ALL …
A spatial parallel heuristic approach for solving very large‐scale vehicle routing problems
The vehicle routing problem (VRP) is one of the most prominent problems in spatial
optimization because of its broad applications in both the public and private sectors. This …
optimization because of its broad applications in both the public and private sectors. This …
Parallel shortest path big data graph computations of US road network using apache spark: survey, architecture, and evaluation
This chapter reports our continuing work on single source shortest path computations of big
data road network graphs using Apache Spark. Smart applications and infrastructures are …
data road network graphs using Apache Spark. Smart applications and infrastructures are …
The MapReduce-based approach to improve the shortest path computation in large-scale road networks: the case of A* algorithm
This paper deals with an efficient parallel and distributed framework for intensive
computation with A* algorithm based on MapReduce concept. The A* algorithm is one of the …
computation with A* algorithm based on MapReduce concept. The A* algorithm is one of the …
Efficient parallel algorithms for dynamic closeness‐and betweenness centrality
Finding the centrality measures of nodes in a graph is a problem of fundamental importance
due to various applications from social networks, biological networks, and transportation …
due to various applications from social networks, biological networks, and transportation …