Parallel Algorithm for Finding the Minimum Edges to Make a Disconnected Directed Acyclic Graph Strongly Connected | IEEE Conference Publication | IEEE Xplore