4 citations · 6 across the 2 of their papers we have counts for
2 papers
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…