Skip to main content
. Author manuscript; available in PMC: 2017 Aug 5.
Published in final edited form as: J Comput Graph Stat. 2016 Aug 5;25(3):762–788. doi: 10.1080/10618600.2015.1037883

Figure 2.

Figure 2

Relative speedups (runtime on CPU/runtime on GPUs) attained by CanAddEdge() for random graphs sampled with various edge-inclusion probabilities. The top panel shows results from using one GeForce GTX 285 GPU, where the bottom panel shows results from using all three GPUs described in sec. 5.1. The five curves in each panel respectively correspond to graphs with 50, 100, 200, 300 and 400 nodes. Each curve shows average speedup for a given dimension, where the associated vertical bars represent the range of speedup (min to max) observed for the given edge-inclusion probability.