Geoffrey Sanders | 17-ERD-024
Executive Summary
We are developing state-of-the-art graph search technologies that meet diverse and rapidly changing customer data analysis needs. These technologies have applications in cybersecurity and intelligence, such as efficiently searching through a large collection of enterprise network transactions for the malicious communication behavior of a botnet.
Publications and Presentations
Bromberger, S. A., et al. 2018. "Improving Estimation of Betweenness Centrality for Scale-Free Graphs." LLNL-TR-741432.
Iwabuchi, K., et al. 2018. "Computing Exact Vertex Eccentricity on Massive-Scale Distributed Graphs." IEEE Cluster, Belfast, UK, Sept. 2018. LLNL-CONF-751522.
Pearce, R. and G. Sanders. 2018. "K-truss Decomposition for Scale-Free Graphs at Scale in Distributed Memory." IEEE High Performance Extreme Computing Conference, Boston, MA, Sept. 2018. LLNL-CONF-757957.
Sanders, G., et al. 2018. "On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices." Graph Algorithms Building Blocks, Vancouver, British Columbia, May 2018. LLNL-CONF-748352.
