Enhancing Cyber Security with Maximum Coupling in Bipartite Graphs / Повышение кибербезопасности с максимальной связью в двудольных графах

Abstract

The problem of maximum coupling in bipartite weighted graphs has important practical applications in defense and security. For instance, in the context of border security, the problem arises in the allocation of resources to monitor and respond to potential threats, where the weights on the edges represent the effectiveness of different resources for detecting or mitigating specific threats. Finding the maximum coupling in such a graph can ensure that the most effective resources are allocated to the most critical areas, thereby improving border security.In addition to military applications, the problem of maximum coupling in bipartite weighted graphs can also enhance network security. By modeling a network as a bipartite graph with nodes representing network components and edges representing their connections, the maximum coupling search method can be used to identify potential security breaches. Any unmatched node in the graph suggests that the component may be compromised or vulnerable to attack, making the maximum coupling search method an effective tool for prioritizing and improving network security. This paper presents a new method for efficiently finding the maximum coupling in a bipartite weighted graph. The proposed method employs an iterative approach that builds on the traditional augmenting path algorithm, but incorporates additional heuristics and pruning techniques to reduce computational complexity. Experimental results demonstrate that the proposed method outperforms existing algorithms in terms of both accuracy and speed. The method's effectiveness and efficiency make it a valuable tool for enhancing defense and security in various applications, including military operations and network security.