most citedA novel and efficient algorithm for scanning all minimal cutsets of a graph

5 citations · 5 across the 1 of their papers we have counts for

collaborators

1 paper

math.CO2002★ 5 cited

A novel and efficient algorithm for scanning all minimal cutsets of a graph

Ahmad R. Sharafat, Omid R. Ma'rouzi

We propose a novel algorithm for enumerating and listing all minimal cutsets of a given graph. It is known that this problem is NP-hard. We use connectivity properties of a given g…