Pages that link to "Item:Q1300055"
From MaRDI portal
The following pages link to Coverings and structure of crossing families (Q1300055):
Displaying 11 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- Covering symmetric supermodular functions by uniform hypergraphs (Q598465) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- Uncrossing a family of set-pairs (Q873653) (← links)
- Covering by intersecting families (Q1881681) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- Unifying the representation of symmetric crossing families and weakly partitive families (Q2851484) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- 2-node-connectivity network design (Q6122594) (← links)
- Approximation algorithms for node and element connectivity augmentation problems (Q6635706) (← links)