title: ÐÐ»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¸ÑÐµÑÐºÐ¸Ð¹ Ð¿Ð¾Ð´Ñ Ð¾Ð´ Ðº Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½ÑÑ Ð¸ Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½ÑÑ Ð¿Ð¾ ÑÑÑÐ³Ð¸Ð²Ð°Ð½Ð¸Ñ k-ÑÐ²ÑÐ·Ð½ÑÑ Ð³ÑÐ°ÑÐ¾Ð²
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Algorithmic approach for minimal and minimal contraction k-connected graphs research
Creators: name: ÐÑÐ±ÐºÐ¾Ð²Ð°, ÐÐ°ÑÑÑ
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2021
Subjects: k-ÑÐ²ÑÐ·Ð½Ð¾ÑÑÑ
Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½Ð¾ÑÑÑ
Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½Ð¾ÑÑÑ Ð¿Ð¾ ÑÑÑÐ³Ð¸Ð²Ð°Ð½Ð¸Ñ
Ð³ÑÐ°ÑÑ
k-connection
minimum
contraction minimum
graphs

description: Ð Ð°Ð±Ð¾ÑÐ° Ð¿Ð¾ÑÐ²ÑÑÐµÐ½Ð° ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐºÐµ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ Ð³ÑÐ°ÑÐ¾Ð² Ð½Ð° ÑÐ²Ð¾Ð¹ÑÑÐ²Ð° Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½Ð¾ÑÑÐ¸, Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½Ð¾ÑÑÐ¸ Ð¿Ð¾ ÑÑÑÐ³Ð¸Ð²Ð°Ð½Ð¸Ñ Ð¸ k-ÑÐ²ÑÐ·Ð½Ð¾ÑÑÐ¸. Ð¦ÐµÐ»Ñ ÑÐ°Ð±Ð¾ÑÑ â Ð¿Ð¾Ð¸ÑÐº Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½ÑÑ Ð¸ Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½ÑÑ Ð¿Ð¾ ÑÑÑÐ³Ð¸Ð²Ð°Ð½Ð¸Ñ k-ÑÐ²ÑÐ·Ð½ÑÑ Ð³ÑÐ°ÑÐ¾Ð². ÐÐ°ÑÑÐ¾ÑÑÐ°Ñ Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° ÑÐ¾Ð´ÐµÑÐ¶Ð¸Ñ Ð¾Ð±Ð·Ð¾Ñ ÑÑÑÐµÑÑÐ²ÑÑÑÐ¸Ñ ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐ¾Ð² Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ð¹ ÑÐ°ÑÑÐ¼Ð°ÑÑÐ¸Ð²Ð°ÐµÐ¼ÑÑ Ð³ÑÐ°ÑÐ¾Ð², Ð¼ÐµÑÐ¾Ð´Ð¾Ð² Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ Ð½Ð° k-ÑÐ²ÑÐ·Ð½Ð¾ÑÑÑ Ð¸ Ð²ÑÐ¿Ð¾Ð¼Ð¾Ð³Ð°ÑÐµÐ»ÑÐ½ÑÑ Ð¼ÐµÑÐ¾Ð´Ð¾Ð². ÐÑÑÐ¾Ð´Ñ Ð¸Ð· ÑÐ°ÑÑÐ¼Ð¾ÑÑÐµÐ½Ð½ÑÑ Ð´Ð°Ð½Ð½ÑÑ, Ð¿ÑÐµÐ´Ð»Ð¾Ð¶ÐµÐ½ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ Ð²ÑÐ¾Ð´ÑÑÐ¸Ñ Ð³ÑÐ°ÑÐ¾Ð² Ð½Ð° ÑÐ²Ð¾Ð¹ÑÑÐ²Ð° Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½Ð¾ÑÑÐ¸, Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½Ð¾ÑÑÐ¸ Ð¿Ð¾ ÑÑÑÐ³Ð¸Ð²Ð°Ð½Ð¸Ñ Ð¸ k-ÑÐ²ÑÐ·Ð½Ð¾ÑÑÐ¸, Ð° ÑÐ°ÐºÐ¶Ðµ Ð¿Ð¾Ð¸ÑÐº Ð³ÑÐ°ÑÐ¾Ð², Ð¾Ð±Ð»Ð°Ð´Ð°ÑÑÐ¸Ñ ÑÐ°ÐºÐ¸Ð¼Ð¸ ÑÐ²Ð¾Ð¹ÑÑÐ²Ð°Ð¼Ð¸ Ð²Ð½ÑÑÑÐ¸ Ð·Ð°Ð´Ð°Ð½Ð½Ð¾Ð³Ð¾ Ð½Ð° Ð²ÑÐ¾Ð´ Ð³ÑÐ°ÑÐ°. Ð ÐµÐ·ÑÐ»ÑÑÐ°ÑÐ¾Ð¼ ÑÐ°Ð±Ð¾ÑÑ ÑÐ²Ð»ÑÐµÑÑÑ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð°, ÑÐµÐ°Ð»Ð¸Ð·ÑÑÑÐ°Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ Ð³ÑÐ°ÑÐ¾Ð² Ð½Ð° ÑÐ²Ð¾Ð¹ÑÑÐ²Ð° k-ÑÐ²ÑÐ·Ð½Ð¾ÑÑÐ¸, Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½Ð¾ÑÑÐ¸ Ð¸ Ð¼Ð¸Ð½Ð¸Ð¼Ð°Ð»ÑÐ½Ð¾ÑÑÐ¸ Ð¿Ð¾ ÑÑÑÐ³Ð¸Ð²Ð°Ð½Ð¸Ñ, Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¿Ð¾Ð¸ÑÐºÐ° Ð³ÑÐ°ÑÐ¾Ð², Ð¾Ð±Ð»Ð°Ð´Ð°ÑÑÐ¸Ñ Ð¿ÑÐµÐ´ÑÐ´ÑÑÐ¸Ð¼Ð¸ ÑÐ²Ð¾Ð¹ÑÑÐ²Ð°Ð¼Ð¸.
description: The work is devoted to the development of an algorithm for checking graphs for the properties of minimality, minimality in contraction and k-connectivity. The work is devoted to the development of an algorithm for checking graphs for the properties of minimality, minimality in contraction and k-connectivity. The purpose of this work is to find minimal and minimal contraction k-connected graphs. This final qualifying work contains an overview of existing research results of the considered graphs, k-connectivity verification methods and auxiliary methods. Based on considered data, an algorithm is proposed for checking incoming graphs for properties of minimality, contraction minimality and k-connectivity, as well as for searching for graphs with such properties inside the graph given at the input. The result of the work is a program that implements an algorithm for checking graphs for the properties of k-connectivity, minimality and contraction minimality, an algorithm for finding graphs with the previous properties.