Pages that link to "Item:Q598465"
From MaRDI portal
The following pages link to Covering symmetric supermodular functions by uniform hypergraphs (Q598465):
Displaying 16 items.
- Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
- Covering skew-supermodular functions by hypergraphs of minimum total size (Q1038104) (← links)
- Covering symmetric supermodular functions by graphs (Q1300054) (← links)
- Minimal edge-coverings of pairs of sets (Q1898731) (← links)
- The even split rule for (concave) symmetric supermodular functions (Q2292771) (← links)
- Testing the supermodular-cut condition (Q2350909) (← links)
- Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank (Q2404617) (← links)
- A unifying approach to splitting-off (Q2448935) (← links)
- The Generalized Terminal Backup Problem (Q2947440) (← links)
- Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (Q2968515) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- (Q3617663) (← links)
- (Q5417727) (← links)