Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (Q2968515): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1137/140996902
@@ Property / full work available at URL: https://doi.org/10.1137/140996902 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2593631936
@@ Property / OpenAlex ID: W2593631936 / rank @@
+Normal rank
@@ Property / cites work @@
+Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
+Normal rank
@@ Property / cites work @@
+Edge-Connectivity Augmentation with Partition Constraints
+Normal rank
@@ Property / cites work @@
+Augmenting hypergraphs by edges of size two
@@ Property / cites work: Augmenting hypergraphs by edges of size two / rank @@
+Normal rank
@@ Property / cites work @@
+Covering symmetric supermodular functions by graphs
+Normal rank
@@ Property / cites work @@
+Q5417727
@@ Property / cites work: Q5417727 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4633938
@@ Property / cites work: Q4633938 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Connectivity Augmentations of Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank