Submodular functions in graph theory

DOI10.1016/0012-365X(93)90158-PzbMath0788.05078MaRDI QIDQ686469

András Frank

Publication date: 4 January 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphsubmodular functions

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items

Ideal, non-extended formulations for disjunctive constraints admitting a network representation, Structures of subpartitions related to a submodular function minimization, On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs, Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs, On the complexity of submodular function minimisation on diamonds, Sublattices of product spaces: Hulls, representations and counting, Approximating the smallest k -edge connected spanning subgraph by LP-rounding, Submodular function minimization, Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized polymatroids and submodular flows
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• On two minimax theorems in graph
• Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
• On the Problem of Decomposing a Graph into n Connected Factors
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• On Representatives of Subsets