Приложение задачи поиска минимального покрытия в графе для повышения надежности системы цифровой личности
Работая с сайтом, я даю свое согласие на использование файлов cookie. Это необходимо для нормального функционирования сайта, показа целевой рекламы и анализа трафика. Статистика использования сайта обрабатывается системой Яндекс.Метрика
Научный журнал Моделирование, оптимизация и информационные технологииThe scientific journal Modeling, Optimization and Information Technology
Online media
issn 2310-6018

Application of the task of finding the minimum vertex coverage in a graph to improve the robustness of digital identity system

idAkutin A.S., idPechenkin V.V.

UDC 004.75
DOI: 10.26102/2310-6018/2025.49.2.015

  • Abstract
  • List of references
  • About authors

This paper examines the features of building digital identity systems for managing information technology processes in an enterprise, the architecture of which depends on decentralized data registers - blockchains. The paper considers blockchains as weighted graphs and formulates a number of theses that speak about the specifics of the functioning of such distributed networks in real information technology enterprises. The features of various network topologies and possible architectural vulnerabilities and flaws that can affect the operation of the entire network are considered – centralization of mining, centralization of staking, various attacks on a functioning network (topological and 51% percent attack). Blockchains using various consensus-building algorithms, taking into account their features, are considered. The paper considers the task of finding the minimum coverage in a graph and emphasizes the importance of applying this task to the described digital personality system in order to increase the reliability of the blockchain computer network by analyzing its topology. Various methods of finding the minimum coverage in a graph are considered – exact and heuristic algorithms. The paper analyzes an application that implements the ant colony algorithm to solve the problem, provides numerical characteristics of the algorithm and its formal description.

Keywords: digital identity system, blockchain, distributed systems, graphs, minimum coverage search

For citation: Akutin A.S., Pechenkin V.V. Application of the task of finding the minimum vertex coverage in a graph to improve the robustness of digital identity system. Modeling, Optimization and Information Technology. 2025;13(2). URL: https://moitvivt.ru/ru/journal/pdf?id=1883 DOI: 10.26102/2310-6018/2025.49.2.015 (In Russ).

196

Full text in PDF

Received 04.04.2025

Revised 18.04.2025

Accepted 24.04.2025

Published 30.06.2025