|
|
|
|
|
Andrii Morozov,Tamara Loktikova,Iurii Iefremov,Anatolii Dykyi,Pavlo Zabrodskyy
Pág. 21 - 28
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 eac...
ver más
|
|
|
|
|