1. A computer-implemented method, comprising: identifying a graph with a plurality of vertices; categorizing the plurality of vertices by: assigning a predetermined plurality of random numbers to each vertex of the plurality of vertices; determining whether each of the assigned predetermined plurality of random numbers of a single vertex is greater than a corresponding random number of the assigned predetermined plurality of random numbers of each of the neighbors of the single vertex; determining whether the Nth assigned number of the single vertex is a local minimum when compared against the Nth assigned number of each of the neighbors of the single vertex; and selecting, in response to the determination, one of the assigned random numbers from a group of assigned random numbers of the single vertex, wherein the categorizing of the plurality of vertices is optimized.