77 citations · 179 across the 4 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DC2017★ 68 cited
Streaming Graph Challenge: Stochastic Block Partition
Edward Kao, Vijay Gadepally, Michael Hurley +9
An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition prob…
cs.DC2017★ 77 cited
Static Graph Challenge: Subgraph Isomorphism
Siddharth Samsi, Vijay Gadepally, Michael Hurley +9
The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties. Th…