Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be ...Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.展开更多
A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graph G(V,E) is proposed. It runs in O(logn) time with O(m/log+n+n) processors on an EREW PRAM for a class of graph set Ⅱ,...A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graph G(V,E) is proposed. It runs in O(logn) time with O(m/log+n+n) processors on an EREW PRAM for a class of graph set Ⅱ, where n=V, m = E and Ⅱ includes at leut (i) planar graphs; (ii) graphs of bounded genus; and (iii) graphs of bounded maximum degree and so on. Our algorithm improves the previoualy known best algoritbms by a factor of logn in the time complexity with linear number of processors on EREW PRAMs when the input is limited to Ⅱ.展开更多
文摘Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.
文摘A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graph G(V,E) is proposed. It runs in O(logn) time with O(m/log+n+n) processors on an EREW PRAM for a class of graph set Ⅱ, where n=V, m = E and Ⅱ includes at leut (i) planar graphs; (ii) graphs of bounded genus; and (iii) graphs of bounded maximum degree and so on. Our algorithm improves the previoualy known best algoritbms by a factor of logn in the time complexity with linear number of processors on EREW PRAMs when the input is limited to Ⅱ.
