A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Minimum cut bases in undirected networks

2010
*
Discrete Applied Mathematics
*

Given an undirected, connected network G = (V, E) with weights on the edges, the cut basis problem is asking for a maximal number of linear independent cuts such that the sum of the cut weights is minimized. Surprisingly, this problem has not attained as much attention as its graph theoretic counterpart, the cycle basis problem. We consider two versions of the problem, the unconstrained and the fundamental cut basis problem. For the unconstrained case, where the cuts in the basis can be of an

doi:10.1016/j.dam.2009.07.015
fatcat:xx7m2fz7vfaw7ms6cxkht7fbau