Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 journals/corr/abs-2307-01109
%A Deligkas, Argyrios
%A Eiben, Eduard
%A Gutin, Gregory Z.
%A Neary, Philip R.
%A Yeo, Anders
%D 2023
%J CoRR
%K dblp
%T Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem.
%U http://dblp.uni-trier.de/db/journals/corr/corr2307.html#abs-2307-01109
%V abs/2307.01109
@article{journals/corr/abs-2307-01109,
added-at = {2023-07-10T00:00:00.000+0200},
author = {Deligkas, Argyrios and Eiben, Eduard and Gutin, Gregory Z. and Neary, Philip R. and Yeo, Anders},
biburl = {https://www.bibsonomy.org/bibtex/2a75a0e9987d9b3b24b669d8df33e51e4/dblp},
ee = {https://doi.org/10.48550/arXiv.2307.01109},
interhash = {7e716116c0a236c688885fede7543a45},
intrahash = {a75a0e9987d9b3b24b669d8df33e51e4},
journal = {CoRR},
keywords = {dblp},
timestamp = {2024-04-08T23:10:22.000+0200},
title = {Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem.},
url = {http://dblp.uni-trier.de/db/journals/corr/corr2307.html#abs-2307-01109},
volume = {abs/2307.01109},
year = 2023
}