Before revision:  For instance, we can solve the restless reachability problem by restricting the path length to 9 in a real-world graph dataset with over 36 million directed edges in less than one hour on a 4-core Haswell desktop .
After revision:  For instance, we can solve the restless reachability problem by restricting the path length to 9 in a real-world graphs .