CPC G06F 9/5061 (2013.01) [G06F 9/3885 (2013.01); G06F 9/5016 (2013.01); G06F 16/9024 (2019.01)] | 20 Claims |
1. A method of partitioning a graph for processing, the method comprising:
sorting two or more vertices of the graph based on incoming edges and outgoing edges;
placing a first one of the vertices with fewer incoming edges in a first partition; and
placing a second one of the vertices with fewer outgoing edges in a second partition.
|