I'm working with very big graph (millions of nodes) that have this structure:
I'd like to solve the maximum flow/minimum cut problem in parallel by splitting the graph into multiple parts in order to use more than one CPU core.
I know that there are approaches to do so but I can' understand well how to use them in my graph.
Can you help me?
Thank you!