1 research outputs found
Π‘ΠΎΠΏΠΎΡΡΠ°Π²Π»Π΅Π½ΠΈΠ΅ Π½Π° Π³ΡΠ°ΡΠ°Ρ
Π¨ΡΡΡ ΠΠ°ΡΠΈΠ»ΠΈΠΉ ΠΠΈΠΊΠΎΠ»Π°Π΅Π²ΠΈΡ, Π‘Π²ΠΈΡΡΠΊΠΈΠΉ Π. Π., Π‘ΠΎΠ»ΠΎΠΌΠΈΡΠΊ Π. Π‘., ΠΡΡΠ·Π΅Π² Π. Π. Π‘ΠΎΠΏΠΎΡΡΠ°Π²Π»Π΅Π½ΠΈΠ΅ Π½Π° Π³ΡΠ°ΡΠ°Ρ
This work is devoted to development of new algorithm of the decision of a matter about matching. In the result the algorithm of search maximal matching in graphs has been developed and realized, the estimation of its complexity, and comparison with existing algorithms have been made. Its characteristics, merits and demerits have been investigated too