TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration

The maximum-flow (max-flow) problem is a classic combinatorial optimization problem that has been used in many kinds of applications.The existing methods accelerate by contracting large-size subgra...