Symbolic Logic Protected: Maximum flow and graph cut (1) Maximum volume and minimum s-t cut
Application of undermodular optimization, an optimization method for discrete information used in digital transformation, artificial intelligence, and machine learning tasks, to minimum cut and maximum flow problems for directed graphs