@article{b95ab7b2d48a4887a2883de985bae182,
title = "SCCMulti: An Improved Parallel Strongly Connected Components Algorithm",
keywords = "parallel graph algorithms, randomized algorithms, strongly connected components",
author = "Daniel Tomkins and Timmie Smith and Amato, \{Nancy M.\} and Lawrence Rauchwerger",
note = "This research supported in part by NSF awards CNS- 0551685, CCF-0833199, CCF-0830753, IIS-0916053, IIS- 0917266, EFRI-1240483, RI-1217991, by NIH NCI R25 CA090301-11, by DOE awards DE-AC02-06CH11357, B575363, by Samsung, by Award KUS-C1-016-04, made by King Abdullah University of Science and Technology (KAUST). This research used resources of the National Energy Research Scientific Computing Center, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231.",
year = "2014",
month = feb,
day = "6",
doi = "10.1145/2692916.2555286",
language = "English (US)",
volume = "49",
pages = "393--394",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery",
number = "8",
}