The following pages link to Edge-augmentation of hypergraphs (Q1300051):
Displaying 16 items.
- Maximally edge-connected hypergraphs (Q501024) (← links)
- Covering symmetric supermodular functions by uniform hypergraphs (Q598465) (← links)
- Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
- Edge-connectivity augmentation of graphs over symmetric parity families (Q998390) (← links)
- Augmenting hypergraphs by edges of size two (Q1300052) (← links)
- Hypergraph connectivity augmentation (Q1300056) (← links)
- Successive edge-connectivity augmentation problems (Q1300062) (← links)
- Parallel and fast sequential algorithms for undirected edge connectivity augmentation (Q1300063) (← links)
- Edge splitting and connectivity augmentation in directed hypergraphs. (Q1417568) (← links)
- A note on optimal covering augmentation for graphic polymatroids. (Q1603399) (← links)
- Edge-connectivity in hypergraphs (Q2065350) (← links)
- Sufficient conditions for hypergraphs to be maximally edge-connected (Q2335157) (← links)
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph (Q2851459) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- (Q5210490) (← links)
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)