4 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DS2023
Expanding the Scope of DAWN: A Novel Version for Weighted Shortest Path Problem
Yelai Feng
The shortest path problem is a typical problem in graph theory with wide potential applications. The state-of-the-art single-source shortest paths algorithm on the weight graph is…
cs.DC2022★ 2 cited
DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs
Yelai Feng, Huaixi Wang, Yining Zhu +3
The shortest paths problem is a fundamental challenge in graph theory, with a broad range of potential applications. The algorithms based on matrix multiplication exhibits excellen…
cs.CE2022★ 4 cited
A Faster Algorithm for Betweenness Centrality Based on Adjacency Matrices
Yelai Feng, Huaixi Wang
Betweenness centrality is essential in complex network analysis; it characterizes the importance of nodes and edges in networks. It is a crucial problem that exactly computes the b…