"Breaking the Sorting Barrier for Directed Single-Source Shortest Paths" by Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, and Longhui Yin (2025) Use the road_network_benchmark example to evaluate the ...

ABSTRACT: With the deepening of global economic integration, maritime logistics has become the core pillar of international trade, carrying more than 80% of global trade volume. Among the factors ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Abstract: This study focuses on the urban transportation system by using the ant colony algorithm and Dijkstra's algorithm, aiming to comprehensively analyze the transportation system by combining ...

ABSTRACT: This paper contributes to the theoretical literature by analyzing the relationship between changes in sparsity and their impacts on financial networks with incomplete and random ...

Graph theory is an integral component of algorithm design that underlies sparse matrices, relational databases, and networks. Improving the performance of graph algorithms has direct implications to ...

The project focuses on efficiently finding paths from a single source to multiple destination nodes within a strongly connected, directed graph with positive edge weights, specifically tailored for an ...