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
2022.04.28
Symbolic Logicグラフ理論スパースモデリング幾何学:Geometry推論技術:inference Technology数理論理学最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics関係データ学習