Submodular Functions in Problems of Synthesis of Networks

Authors:
F. A. Sharifov
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2001

Citing 4
Cited 0

Optimal attack and reinforcement of a network

Journal of the ACM (JACM)
On submodular function minimization

Combinatorica
A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
Computing the strength of a graph

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is established that any problem of minimization of a general submodular function is the problem of determination of a minimum cut in a network if, for an arbitrary set, the dual function is defined as the sum of its values on the two-element subsets of this set. This result is used to synthesize a network with the help of a cut submodular function.