local algorithms on graphs are algorithms that run in parallel on the nodes
of a graph to compute some global structural feature of the graph. Such
algorithms use only local information available at nodes to determine local
aspects of the global structure, while also potentially using