 Extensive experiments verify that our G-thinker algorithm scales perfectly with the number of CPU cores, achieving over 300x speedup when running on a graph with over 1M vertices in a small cluster.
<clarity>  Extensive experiments verify that our G-thinker algorithm scales perfectly with the number of CPU cores, achieving over 300x speedup when running on a graph with over 1M vertices in a small cluster.
 Extensive experiments verify that our new solution scales well with the number of CPU cores, achieving over 300x speedup when running on a graph with over 1M vertices in a small cluster.