Modeling of the algorithm for computing the term rank of a matrix based on the construction of a bipartite graph in the MATLAB environment

We consider a method for computing the term rank of a matrix based on the construction of a bipartite graph. The term rank of the binary matrix ?? is defined to be a minimum number of rows and columns that contain all nonzero elements of the matrix. In this paper, we discuss the Ford-Fulkerson algorithm for the maximum flow problem. Then we propose to model the algorithm in the MATLAB environment. The application of this algorithm for evaluating the characteristics of codes in a term rank metric is considered.