FINDING FIRST, SECOND AND THIRD ORDER GRAPH CUTS

An effective method for finding 1-, 2-, 3-order cuts based on procedure of finding all minimal cut graph sets is offered,i.e. a method for finding the cuts which are not being minimal.

Keywords

graph, minimal cut, quasiminimal cut, undecomposable (nonreducible) cut, distributive lattice, algorithm