A. J. Perez Tchernov

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Given an undirected connected network G = (V, E), n = |V |, m = |E|, and a weight function w : E → R + , finding a basis of the cut space with minimum sum of the cut weights is termed Minimum Cut Basis Problem. This problem can be solved, e.g., by the algorithm of Gomory and Hu [GH61]. If, however, fundamentality is required, i.e., the basis is induced by a(More)
  • 1