Recommendations
Cites work
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3799695 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
- Generalized polymatroids and submodular flows
- Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
- On Representatives of Subsets
- On the Problem of Decomposing a Graph into n Connected Factors
- On two minimax theorems in graph
Cited in
(13)- Submodular function minimization
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)
- Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
- Variations for Lovász’ Submodular Ideas
- Sublattices of product spaces: Hulls, representations and counting
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- On the monotonicity of games generated by symmetric submodular functions.
- Structures of subpartitions related to a submodular function minimization
- On vertices of outdegree \(k\) in minimally \(k\)-arc-connected digraphs
- Connectivity of submodular functions
- On the complexity of submodular function minimisation on diamonds
This page was built for publication: Submodular functions in graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686469)
