Nicole C. Rodia

Learn More
Detecting strongly connected components (SCCs) in a directed graph is a fundamental graph analysis algorithm that is used in many science and engineering domains. Traditional approaches in parallel SCC detection, however, show limited performance and poor scaling behavior when applied to large <i>real-world</i> graph instances. In this paper, we investigate(More)
Detecting strongly connected components (SCCs) in a directed graph is a fundamental graph analysis algorithm that is used in many science and engineering domains. Traditional approaches in parallel SCC detection, however, show limited performance and poor scaling behavior when applied to large real-world graph instances. In this paper, we investigate the(More)
Research is never carried out in isolation. Scholars build on each other’s findings, work together on problems, work on problems in parallel, and often verify each other’s results. The success of the academic enterprise is dependent on all its participants communicating their ideas, techniques, and findings with each other and with the public. Given the(More)
  • 1