Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2022_29_1_a0, author = {V. V. Voroshilov}, title = {Complexity of the max cut problem with~the~minimal domination constraint}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {5--17}, publisher = {mathdoc}, volume = {29}, number = {1}, year = {2022}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DA_2022_29_1_a0/} }
V. V. Voroshilov. Complexity of the max cut problem with~the~minimal domination constraint. Diskretnyj analiz i issledovanie operacij, Tome 29 (2022) no. 1, pp. 5-17. http://geodesic.mathdoc.fr/item/DA_2022_29_1_a0/