Pages that link to "Item:Q1300052"

The following pages link to Augmenting hypergraphs by edges of size two (Q1300052):

Displaying 15 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)
• The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
• Edge-connectivity in hypergraphs (Q2065350) (← links)
• Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
• Modeling emergency response operations: a theory building survey (Q2177817) (← links)
• Sufficient conditions for hypergraphs to be maximally edge-connected (Q2335157) (← links)
• Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank (Q2404617) (← links)
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph (Q2851459) (← links)
• The Generalized Terminal Backup Problem (Q2947440) (← links)
• Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (Q2968515) (← links)
• Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
• Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph (Q4916091) (← links)
• Approximation algorithms for node and element connectivity augmentation problems (Q6635706) (← links)