Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Iurii Iefremov"'
Autor:
Anatolii Dykyi, Pavlo Zabrodskyy, Andrii Vasyliovych Morozov, Iurii Iefremov, Tamara Mykolaivna Loktikova
Publikováno v:
Eastern-European Journal of Enterprise Technologies, Vol 6, Iss 4 (102), Pp 21-28 (2019)
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory, this paper shows that the task on establishing a maximal matching in an arbitrary graph can be reduced to its bipartite case. It has been proven that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b96f16f1ddd3db577dce109f27068da
https://zenodo.org/record/3603842
https://zenodo.org/record/3603842
