Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank
type: Item
instance of: scholarly article
title: Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank
zbMATH Open document ID: 1420.05141
author: Attila Bernáth
published in: Information Processing Letters
publication date: 2017-09-19T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6776063
zbMATH Keywords: edge-connectivity augmentation
zbMATH Keywords: crossing supermodular function
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: graph algorithms
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ipl.2017.08.003
OpenAlex ID: W2750675246
cites work: Augmenting hypergraphs by edges of size two
cites work: Covering symmetric supermodular functions by graphs
cites work: A New Approach to Splitting-Off
cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements
cites work: Edge-connectivity augmentation problems
DOI: 10.1016/J.IPL.2017.08.003
Recommended article: Covering symmetric supermodular functions by graphs
Recommended article: Covering symmetric supermodular functions by uniform hypergraphs
Recommended article: Q5417727
Recommended article: Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
Recommended article: Covering skew-supermodular functions by hypergraphs of minimum total size
Recommended article: A Survey on Covering Supermodular Functions
Recommended article: ON SUPER f-EDGE COVER-COLORING IN MULTIGRAPHS
Recommended article: Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
Recommended article: Q3642433
Recommended article: Q3617663
description: scientific article; zbMATH DE number 6776063