Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel
IEEE Transactions on Parallel and Distributed Systems
An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs
Nordic Journal of Computing
Hi-index | 0.89 |