Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank
Keywords: افزایش لبه اتصال; Edge-connectivity augmentation; Crossing supermodular function; Polynomial algorithm; Graph algorithms;