A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph

Abstract

By defining a suitable algebra for cut sets, it is possible to reduce the problem of enumerating the cut sets between all pairs of nodes in a graph to the problem of solving a system of linear equations. An algorithm for solving this system using Gaussian elimination is presented in this paper. The efficiency of the algorithm depends on the implementation of sum and multiplication. Therefore, some properties of cut sets are investigated, which greatly simplify the implementation of these operations for the case of undirected graphs. The time required by the algorithm is shown to be linear with the number of cut sets for complete graphs. Some experimental results are given, proving that the efficiency of the algorithm increases by increasing the number of pairs of nodes for which the cut sets are computed. © 1976, ACM. All rights reserved.