Author:
Sharifov F.,Hulianytskyi L.
Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. F. Sharifov and L. Hulianytskyi, “Cuts in undirected graphs. I,” Cybern. Syst. Analysis, Vol. 56, No. 4, 559–565 (2020). https://doi.org/10.1007/s10559-020-00272-3.
2. M. S. Bazaraa, H. D. Sherali, and M. C. Shetty, Nonlinear Programming: Theory and Algorithms, J. Wiley and Sons, New York (1979).
3. Satoru Iwata, “Submodular function minimization,” Math. Program., Ser. B, Vol. 112, 45–64 (2008).
4. F. A. Sharifov, “Finding the maximum cut by the greedy algorithm,” Cybern. Syst. Analysis, Vol. 54, No. 5, 737–743 (2018). https://doi.org/10.1007/s10559-018-0075-3.
5. S. Fujishige, “Submodular function and optimization,” in: Annals of Discrete Mathematics (2005).