Algorithms for the Determination of Cutsets in a Hypergraph
姚荣, 康泰, 陈廷槐 · 1990
Given a hypergraph,this paper provides three algorithms for finding all its minimal cutsets,minimal link cutsets and the least cutsets.The result not only set up a new studying field on cutsets of hypergraph,but also lay a foundation of analyzing the performance of multibus systems.The algorithm for determining all the least cutsets in a hypergaph is polynomial complex and more efficient than that in [2].