On finding fundamental cut sets
In this paper a linear time algorithm is proposed for preprocessing the edges of a graph. After preprocessing (in linear time). the fundamental cut set of ally tree edge call be determined in time proportional to the size of that cut set. (C) 2009 Elsevier B.V. All rights reserved.
fundamental cut sets algorithms graph algorithms