Minimum cuts, modular functions, and matroid polyhedra
WH Cunningham - Networks, 1985 - Wiley Online Library
WH Cunningham
Networks, 1985•Wiley Online LibraryThe minimum cut problem is a well‐solved special case of submodular function
minimization. We show that it is in fact equivalent to minimizing a modular function over a
ring family. One‐half of this equivalence follows from classical work of Rhys and Picard. We
give a number of applications to testing membership in special kinds of matroid polyhedra.
minimization. We show that it is in fact equivalent to minimizing a modular function over a
ring family. One‐half of this equivalence follows from classical work of Rhys and Picard. We
give a number of applications to testing membership in special kinds of matroid polyhedra.
Abstract
The minimum cut problem is a well‐solved special case of submodular function minimization. We show that it is in fact equivalent to minimizing a modular function over a ring family. One‐half of this equivalence follows from classical work of Rhys and Picard. We give a number of applications to testing membership in special kinds of matroid polyhedra.
Wiley Online LibraryShowing the best result for this search. See all results