A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

Traditional path planning algorithms often face problems such as local optimum traps and low monitoring efficiency in agricultural UAV operations, making it difficult to meet the operational ...

Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin (2025): Breaking the Sorting Barrier for Directed Single-Source Shortest Paths“. 57th Annual ACM Symposium on Theory of Computing (STOC). Faster ...

Unmanned surface vehicles (USVs) nowadays have been widely used in ocean observation missions, helping researchers to monitor climate change, collect environmental data, and observe marine ecosystem ...

ABSTRACT: In any military operation, reliable logistics is essential to maintaining a combat-effective force. Without the continual resupply of ammunition, food, and other materiel, forces cannot ...

ABSTRACT: In any military operation, reliable logistics is essential to maintaining a combat-effective force. Without the continual resupply of ammunition, food, and other materiel, forces cannot ...

Abstract: Graph theory is a critical field in computer science and mathematics, particularly in solving shortest path problems. In this paper, a comparative analysis of Breadth-First Search (BFS) and ...

Abstract: The computation of the k-shortest paths, should they be elementary or not, has been extensively investigated in the literature, yielding to extremely performant algorithms. For elementary ...