Abstract：In this paper a algorithm to find all cutsets for any connected graphhad been presented. The algorithm not only can erase easily redundancy term but alsoit is convenient to find cutset or cutset groups satisfied som special condition. Thealgorithm had bee
1990, Vol. 12 