Minimum cut bases in undirected networks

  title={Minimum cut bases in undirected networks},
  author={Florentine Bunke and H. Hamacher and F. Maffioli and Anne M. Schwahn},
  journal={Discret. Appl. Math.},
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 another graph theoretic problem closely related to it, namely, 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… Expand
A basis for
Cooperative Cuts: Graph Cuts with Submodular Edge Weights
Graph cuts with interacting edge weights: examples, approximations, and algorithms
Properties of Gomory-Hu co-cycle bases
  • T. Kavitha
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2012
Notes on Graph Cuts with Submodular Edge Weights
Cyclic matrices of weighted digraphs
  • Ricardo Riaza
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2012
Cooperative Cuts for Image Segmentation
In memoriam of Francesco Maffioli (1941-2012)


On Min-Max Cycle Bases
On the approximability of the minimum strictly fundamental cycle basis problem
On the Approximability of the Minimum Fundamental Cycle Basis Problem
Algorithms for Generating Fundamental Cycles in a Graph
Edge-swapping algorithms for the minimum fundamental cycle basis problem
Very Simple Methods for All Pairs Network Flow Analysis
  • D. Gusfield
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1990
A Faster Algorithm for Minimum Cycle Basis of Graphs
The zoo of tree spanner problems
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
  • J. Horton
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1987
On a Special Co-cycle Basis of Graphs